Region level via centralization for hyperplane arrangements and beyond
Finn Southerland, Lani Southern, Su Zhou

TL;DR
This paper revisits Zaslavsky's enumeration of hyperplane arrangement regions by level, introduces a centralization construction, and extends the results to geometric semilattices and arrangement deformations.
Contribution
It restates Zaslavsky's theorem using centralization, generalizes the concept to geometric semilattices, and applies it to deformations of the braid arrangement.
Findings
Enumeration of regions depends only on the intersection poset.
Derived a general expression for the characteristic polynomial of geometric semilattices.
Applied the theorem to obtain identities and formulas for arrangement deformations.
Abstract
In "Faces of a Hyperplane Arrangement Enumerated by Ideal Dimension, with Applications to Plane, Plaids, and Shi," Zaslavsky showed how to compute the number of regions of a real hyperplane arrangement with a given level, refining his well known enumeration of regions and relatively bounded regions. We restate this theorem in terms of a construction called the centralization of , give a bijective proof, and then apply it in two ways to answer questions concerning the concept of level. Firstly, a consequence of this enumeration is that depends only on the intersection poset , such that both and centralization can be defined in the more general setting of geometric semilattices. In this context we derive a very general expression for the characteristic polynomial of a geometric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Polynomial and algebraic computation · Commutative Algebra and Its Applications
