Hyperplane arrangements (collections of codimension-1 subspaces) have long been an object of study in combinatorics, topology, and geometry. This chapter explores the lattice theory of the poset of regions of a (real) hyperplane arrangement. We discuss the open problem, first posed by Björner, Edelman, and Ziegler , of characterizing by local geometric conditions which posets of regions are lattices. We give a local geometric characterization (“tightness”) of which posets of regions are semidistributive lattices. Along the way, we discuss a local condition for checking that a partially ordered set is a lattice, along with analogous local conditions for determining lattice-theoretic properties. In the case of simplicial arrangements (which are in particular tight), we characterize the regions of the arrangement in terms of two notions of combinatorial convexity.
- Lattice Theory
- Maximal Chain
- Lattice Congruence
- Relative Interior
- Hyperplane Arrangement
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Tax calculation will be finalised at checkout
Purchases are for personal use onlyLearn about institutional subscriptions
Unable to display preview. Download preview PDF.
Editors and Affiliations
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Reading, N. (2016). Lattice Theory of the Poset of Regions. In: Grätzer, G., Wehrung, F. (eds) Lattice Theory: Special Topics and Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-44236-5_9
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-44235-8
Online ISBN: 978-3-319-44236-5