閲覧可能ファイル 

ファイル	フォーマット	サイズ	閲覧回数	説明
AAM47-2_379-400	pdf	360 KB	873

論文情報

ファイル出力 EndNote Basic出力 Mendeley出力

アクセス権	open access
URI	https://hdl.handle.net/2115/46876
タイトル	Ranking patterns of unfolding models of codimension one
著者	Kamiya, Hidehiko ; Takemura, Akimichi ; Terao, Hiroaki
著者名 Kamiya, Hidehiko
著者名 Takemura, Akimichi
著者名 Terao, Hiroaki
言語	英語
キーワード	All-subset arrangement
	Braid arrangement
	Chamber
	Characteristic polynomial
	Finite field method
	Hyperplane arrangement
	Ideal point
	Mid-hyperplane arrangement
	Ranking pattern
	Unfolding model
発行日	2011-08
出版者	Elsevier
収録物名	Advances in Applied Mathematics
巻(号)	47(2)
ページ	379-400
抄録	We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all braid slices, including those not associated with unfolding models, are in one-to-one correspondence with the chambers of an arrangement. By identifying those which are associated with unfolding models, we find the number of ranking patterns. We also give an upper bound for the number of ranking patterns when the difference by a permutation of objects is ignored.
資源タイプ	学術雑誌論文
出版タイプ	Accepted Manuscript
PISSN	0196-8858
関連情報 (isVersionOf)	出版社版DOI https://doi.org/10.1016/j.aam.2010.11.002

ホームへ戻る