## Abstract

A hyperplane arrangement is a finite set of hyperplanes through the origin in a finite-dimensional real vector space. Such an arrangement divides the vector space into a finite set of regions. Every such region determines a partial order on the set of all regions in which these are ordered according to their combinatorial distance from the fixed base region.

We show that the base region is simplicial whenever the poset of regions is a lattice and that conversely this condition is sufficient for the lattice property for three-dimensional arrangements, but not in higher dimensions. For simplicial arrangements, the poset of regions is always a lattice.

In the case of supersolvable arrangements (arrangements for which the lattice of intersections of hyperplanes is supersolvable), the poset of regions is a lattice if the base region is suitably chosen. We describe the geometric structure of such arrangements and derive an expression for the rank-generating function similar to a known one for Coxeter arrangements. For arrangements with a lattice of regions we give a geometric interpretation of the lattice property in terms of a closure operator defined on the set of hyperplanes.

The results generalize to oriented matroids. We show that the adjacency graph (and poset of regions) of an arrangement determines the associated oriented matroid and hence in particular the lattice of intersections.

## Article PDF

### Similar content being viewed by others

Avoid common mistakes on your manuscript.

## References

G. Birkhoff,

*Lattice Theory*, AMS Colloquium publications, Vol. 25, 3rd edn., American Mathematical Society, Providence, RI, 1967.A. Björner, Orderings of Coxeter groups, in

*Proc. AMS-NSF Conference on Combinatorics and Algebra*, Boulder, 1983 (ed. C. Greene), Contemporary Mathematics, Vol. 34, American Mathematical Society, Providence, RI, 1984, pp. 175–195.A. Björner, Supersolvable arrangements of hyperplanes,

*Abstracts Amer. Math. Soc.***6**(1985), 182.R. Blind and P. Mani, On puzzles and polytope isomorphisms,

*Aequationes Math.*(to appear).N. Bourbaki,

*Groupes et algèbres de Lie*, Hermann, Paris, 1968, Chapters 4–6.H. Bruggesser and P. Mani, Shellable decompositions of cells and spheres,

*Math. Scand.***29**(1971), 197–205.R. Cordovil, Sur les matroides orientés de rang trois et les arrangements de pseudodroites dans le plan projectif réel,

*European J. Combin.***3**(1982), 307–318.R. Cordovil, A combinatorial perspective on the non-Radon partitions,

*J. Combin. Theory, Ser. A***38**(1985), 38–47.G. Danaraj and V. Klee, Shellings of spheres and polytopes,

*Duke Math. J.***41**(1974), 443–451.P. H. Edelman, The lattice of convex sets of an oriented matroid,

*J. Combin. Theory Ser. B***33**(1982), 239–244.P. H. Edelman, The acyclic sets of an oriented matroid,

*J. Combin. Theory Ser. B***36**(1984), 26–31.P. H. Edelman, A partial order on the regions of ℝ

^{n}dissected by hyperplanes,*Trans. Amer. Math. Soc.***283**(1984), 617–631.P. H. Edelman, Abstract convexity and meet-distributive lattices,

*Proc. AMS-IMS-SIAM Conference on Combinatorics and Ordered Sets*, Arcata, 1985 (ed. I. Rival), Contemporary Mathematics, Vol. 57, American Mathematical Society, Providence, RI, 1986, pp. 127–150.P. H. Edelman and R. Jamison, The theory of convex geometries,

*Geom. Dedicata***19**(1985), 247–270.J. Folkman and J. Lawrence, Oriented matroids,

*J. Combin. Theory Ser. B***25**(1978), 199–236.C. Greene, Acyclic Orientations (Notes), in

*Higher Combinatorics*(ed. M. Aigner), Reidel, Dordrecht, 1977, pp. 65–68.C. Greene and T. Zaslavsky, On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs,

*Trans. Amer. Math. Soc.***280**(1983), 97–126.B. Grünbaum, Convex polytopes, Interscience, London, 1967.

B. Grünbaum, Arrangements of hyperplanes, in

*Proc. Second Louisiana Conference of Combinatorics and Graph Theory*, Baton Rouge (ed. Mullin,*et al.*), 1971.B. Grünbaum,

*Arrangements and Spreads*, AMS Regional Conference Series in Mathematics, Vol. 10, American Mathematical Society, Providence, RI, 1972.B. Grünbaum and G. C. Shephard, Simplicial arrangements in projective 3-space,

*Mitt. Math. Sem. Giessen*(Coxeter Festschrift, Teil IV)**16**(1984), 49–101.M. Jambu and H. Terao, Free arrangements of hyperplanes and supersolvable lattices,

*Adv. in Math.***52**(1984), 248–258.G. Kalai, A simple way to tell a simple polytope from its graph,

*J. Combin. Theory Ser. A*(submitted).M. Las Vergnas, Sur les activités des orientations d'une géometrie combinatoire (Proc. Colloq. Mathématique Discrètes: Codes et Hypergraphes, Bruxelles, 1978),

*Cahiers Centre Études Rech. Opér.***20**(1978), 283–300.M. Las Vergnas, Convexity in oriented matroids,

*J. Combin. Theory Ser. B.***29**(1980), 231–243.C. Lee, Personal communication.

R. Shannon, Simplicial cells in arrangements of hyperplanes,

*Geom. Dedicata***8**(1979), 179–187.L. Solomon, The orders of the finite Chevalley groups,

*J. Algebra***3**(1966), 376–393.R. Stanley, Modular elements in geometric lattices,

*Algebra Universalis***1**(1971), 214–217.R. Stanley, Supersolvable lattices,

*Algebra Universalis***2**(1972), 197–217.R. Stanley,

*T*-free arrangements of hyperplanes, in*Progress in Graph Theory*(eds. J. A. Bondy and U. S. R. Murty), Academic Press, New York, 1984, p. 539.H. Terao, Arrangements of hyperplanes and their freeness, I,

*J. Fac. Sci. Univ. Tokyo Sect. IA Math.***27**(1980), 293–312.H. Terao, Generalized exponents of a free arrangement of hyperplanes and Shephard-Todd-Brieskorn formula,

*Invent. Math.***63**(1981), 159–179.H. Terao, Modular elements of lattices and topological fibration,

*Adv. in Math.***62**(1986), 135–154.H. Terao, Personal communication.

P. Wagreich,

*The Growth Function of a Discrete Group*, Lecture Notes in Mathematics, Vol. 959, Springer-Verlag, Berlin, 1982, pp. 125–144.P. Winkler, Isometric embedding in products of complete graphs,

*Discrete Appl. Math.***7**(1984), 221–225.T. Zaslavsky,

*Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes*, Memoirs of the American Mathematical Society, Vol. 154, American Mathematical Society, Providence, RI, 1975.

## Author information

### Authors and Affiliations

## Additional information

The work of Anders Björner was supported in part by a grant from the NSF. Paul Edelman's work was supported in part by NSF Grants DMS-8612446 and DMS-8700995. The work of Günter Ziegler was done while he held a Norman Levinson Graduate Fellowship at MIT.

## Rights and permissions

## About this article

### Cite this article

Björner, A., Edelman, P.H. & Ziegler, G.M. Hyperplane arrangements with a lattice of regions.
*Discrete Comput Geom* **5**, 263–288 (1990). https://doi.org/10.1007/BF02187790

Received:

Revised:

Published:

Issue Date:

DOI: https://doi.org/10.1007/BF02187790