Chambers of Arrangements of Hyperplanes and Arrow's Impossibility Theorem
Combinatorics
2007-07-05 v2
Abstract
Let be a nonempty real central arrangement of hyperplanes and be the set of chambers of . Each hyperplane defines a half-space and the other half-space . Let . For , define a map by Define Let Then the maps induce the maps . We will study the admissible maps which are compatible with every . Suppose and . Then we will show that is indecomposable if and only if every admissible map is a projection to a omponent. When is a braid arrangement, which is indecomposable, this result is equivalent to Arrow's impossibility theorem in economics. We also determine the set of admissible maps explicitly for every nonempty real central arrangement.
Keywords
Cite
@article{arxiv.math/0608591,
title = {Chambers of Arrangements of Hyperplanes and Arrow's Impossibility Theorem},
author = {Hiroaki Terao},
journal= {arXiv preprint arXiv:math/0608591},
year = {2007}
}