Supersolvable Hyperplane Arrangements

• Supersolvable hyperplane arrangements are central arrangements whose intersection lattices admit maximal modular chains, underpinning factorization phenomena and freeness.
• They enable linear factorization of characteristic polynomials and support recursive constructions that link lattice theory with topological and combinatorial properties.
• Their classification spans major families—graphical, reflection, and root-ideal arrangements—while also highlighting open directions in low exponent and simplicial configurations.

Supersolvable hyperplane arrangements are central arrangements whose intersection lattices admit a maximal chain of modular flats. In Stanley’s sense, if $L(\mathcal A)$ is the geometric lattice of a central arrangement $\mathcal A$ of rank $\ell$, supersolvability means that there exist flats

$V=X_0<X_1<\cdots<X_\ell=\{0\}$

with $\operatorname{rk}(X_i)=i$ and each $X_i$ modular. This condition places the arrangement at a distinguished intersection of lattice theory, freeness, factorization phenomena, and the topology of arrangement complements. Across several major families—graphical, reflection, root-ideal, simplicial, and low-exponent free arrangements—supersolvability admits sharp structural characterizations and often serves as the precise combinatorial condition behind linear factorization of characteristic or Poincaré polynomials, inductive constructions, and fiber-type or $K(\pi,1)$ behavior (Hoge et al., 2012).

1. Foundational formulations

Let $\mathcal A$ be a central arrangement of hyperplanes in a finite-dimensional vector space $V$. Its intersection lattice $L(\mathcal A)$ is the set of all intersections of subfamilies of $\mathcal A$0, ordered by reverse inclusion, and carries rank function $\mathcal A$1 (Tohaneanu, 2017). A flat $\mathcal A$2 is modular if for every $\mathcal A$3, the sum $\mathcal A$4 again lies in $\mathcal A$5; equivalently, modularity can be expressed by the rank identity

$\mathcal A$6

in the lattice-theoretic formulation (Körber et al., 20 Aug 2025).

For a central arrangement of rank $\mathcal A$7, supersolvability is the existence of a maximal modular chain. Rank $\mathcal A$8 and rank $\mathcal A$9 arrangements are automatically supersolvable, since there is at most one nontrivial rank-$\ell$0 element to place in the chain (Hoge et al., 2012). In rank $\ell$1, the notion specializes particularly concretely: for a line arrangement in $\ell$2, supersolvability is equivalent to the existence of a modular point $\ell$3 such that for every other intersection point $\ell$4, the line $\ell$5 belongs to the arrangement (Anzis et al., 2015).

Several equivalent formulations recur in the literature. For reflection and related arrangements, one may use modular chains in the lattice, or block decompositions satisfying Björner–Edelman–Ziegler conditions, or factorization data extracted from successive modular quotients (Körber et al., 20 Aug 2025). For graphical arrangements, supersolvability is equivalent to chordality of the underlying graph, and thus to the existence of a perfect elimination ordering (Lutz, 2017). For ordered matroids, a supersolvable $\ell$6-chain of modular flats provides the parallel matroidal formulation (Dinh et al., 2012).

A common misconception is that supersolvability is merely a convenient sufficient condition for factorization. In the families treated in the cited work, it is usually a much stronger organizing principle: it controls modular flags, recursive decompositions, chamber posets, and several algebraic structures attached to the arrangement.

2. Factorization, freeness, and recursive structure

A central consequence of freeness is Terao’s factorization theorem: if $\ell$7 is free with exponents $\ell$8, then its characteristic polynomial satisfies

$\ell$9

(Tohaneanu, 2017). For supersolvable arrangements, Stanley’s theory refines this by extracting the linear factors directly from a modular chain. If

$V=X_0<X_1<\cdots<X_\ell=\{0\}$0

is modular and $V=X_0<X_1<\cdots<X_\ell=\{0\}$1, then

$V=X_0<X_1<\cdots<X_\ell=\{0\}$2

(Cuntz et al., 2017). This linear factorization is therefore not only a consequence of freeness but a lattice-theoretic signature of supersolvability.

Jambu–Terao proved that every supersolvable arrangement is inductively free, so supersolvable arrangements form a natural subclass of inductively free arrangements (Hoge et al., 2012). In reflection-theoretic contexts, this subclass is proper: there are inductively free reflection arrangements that fail the modular-rank-$V=X_0<X_1<\cdots<X_\ell=\{0\}$3 criterion and hence are not supersolvable (Hoge et al., 2012).

Recursive descriptions are especially important. Björner–Edelman–Ziegler’s deletion–restriction style criterion states that an essential arrangement $V=X_0<X_1<\cdots<X_\ell=\{0\}$4 of rank $V=X_0<X_1<\cdots<X_\ell=\{0\}$5 is supersolvable if and only if there exists a partition

$V=X_0<X_1<\cdots<X_\ell=\{0\}$6

such that $V=X_0<X_1<\cdots<X_\ell=\{0\}$7 is supersolvable of rank $V=X_0<X_1<\cdots<X_\ell=\{0\}$8, and for any $V=X_0<X_1<\cdots<X_\ell=\{0\}$9 there exists $\operatorname{rk}(X_i)=i$0 with $\operatorname{rk}(X_i)=i$1 (Körber et al., 20 Aug 2025). This inductive structure underlies later Hamiltonicity results and the recursive behavior of chamber lattices.

A related formulation appears in fiber-type theory. Terao’s theorem identifies supersolvability of $\operatorname{rk}(X_i)=i$2 with the fiber-type property for linear arrangements, producing an iterated bundle decomposition of the complement $\operatorname{rk}(X_i)=i$3 (Bibby et al., 2022). In the reflection setting, the equivalence “strictly linearly fibered $\operatorname{rk}(X_i)=i$4 fiber type $\operatorname{rk}(X_i)=i$5 supersolvable” holds for reflection arrangements and their restrictions (1311.0620).

3. Classification in major families

Several of the strongest results on supersolvable arrangements are full classifications.

For irreducible complex reflection groups $\operatorname{rk}(X_i)=i$6, Hoge–Röhrle classified the supersolvable reflection arrangements $\operatorname{rk}(X_i)=i$7: they are precisely those of rank $\operatorname{rk}(X_i)=i$8, the Coxeter types $\operatorname{rk}(X_i)=i$9 and $X_i$0 for $X_i$1, and the full monomial groups $X_i$2 with $X_i$3; no other irreducible reflection arrangement is supersolvable (Hoge et al., 2012). Moreover, for irreducible reflection arrangements of rank at least $X_i$4, supersolvability is equivalent to the existence of a modular element of rank $X_i$5 in the intersection lattice (Hoge et al., 2012).

Amend–Hoge–Röhrle extended this to restrictions $X_i$6. For irreducible $X_i$7 of rank at least $X_i$8 and $X_i$9, the restriction is supersolvable exactly in three cases: when $K(\pi,1)$0 itself is supersolvable; when $K(\pi,1)$1 and $K(\pi,1)$2 or $K(\pi,1)$3 with $K(\pi,1)$4; or in the four exceptional $K(\pi,1)$5-dimensional cases $K(\pi,1)$6, $K(\pi,1)$7, $K(\pi,1)$8, and $K(\pi,1)$9 (1311.0620). In this setting, irreducible supersolvable restrictions are characterized by the existence of a modular element of dimension $\mathcal A$0 (1311.0620).

For graphical and Dirichlet arrangements, chordality is decisive. Stanley’s classical criterion says that the graphical arrangement $\mathcal A$1 is supersolvable if and only if $\mathcal A$2 is chordal (Lutz, 2017). Lutz’s theorem extends this to Dirichlet arrangements: if $\mathcal A$3 is obtained by completing the boundary vertices to a clique, then the Dirichlet arrangement $\mathcal A$4 is supersolvable, equivalently free, if and only if $\mathcal A$5 is chordal (Lutz, 2017). The recent result on nice partitions strengthens the same picture: a graphical arrangement has a nice partition if and only if the graph is chordal, and for chordal graphs every nice partition can be induced by a maximal modular chain (Liang et al., 2024).

A more restrictive graph-based family is given by connected-subgraph arrangements $\mathcal A$6, where the hyperplanes are indexed by connected induced subgraphs. In that case, the arrangement is supersolvable if and only if $\mathcal A$7 is a path graph $\mathcal A$8; then $\mathcal A$9 is, up to coordinate change, the type-$V$0 braid arrangement (Cuntz et al., 2022).

For root-ideal arrangements $V$1 attached to order ideals $V$2 in a crystallographic root poset, Hultman proved that $V$3 is supersolvable if and only if $V$4 is chain peelable, meaning that one can iteratively remove maximal chains that are also order filters until the empty poset is reached (Hultman, 2014). In particular, supersolvability is preserved under taking subideals (Hultman, 2014).

4. Low exponents, simpliciality, and rank-specific rigidity

One of the clearest bridges between freeness and supersolvability occurs in low-exponent regimes. Any free hyperplane arrangement with exponent multiset consisting only of $V$5’s and $V$6’s is supersolvable (Tohaneanu, 2017). The proof uses Saito’s criterion to extract a degree-$V$7 derivation, split off a rank-$V$8 direct factor, and proceed inductively. The same work conjectures that any free arrangement with exponents $V$9, with exactly one exponent $L(\mathcal A)$0, is also supersolvable; this is proved there for ranks $L(\mathcal A)$1 and $L(\mathcal A)$2, and for inductively free arrangements of arbitrary rank (Tohaneanu, 2017). This suggests a sharp threshold at small exponents, although the full arbitrary-rank “one $L(\mathcal A)$3” case remains open in that source.

In the real simplicial setting, supersolvability becomes highly rigid. Cuntz and Mücksch gave a complete classification of irreducible supersolvable simplicial arrangements in all ranks (Cuntz et al., 2017). In rank $L(\mathcal A)$4, they are exactly the two infinite series

$L(\mathcal A)$5

up to lattice equivalence (Cuntz et al., 2017). In rank $L(\mathcal A)$6, the only irreducible supersolvable simplicial arrangements are $L(\mathcal A)$7, $L(\mathcal A)$8, and $L(\mathcal A)$9; for rank $\mathcal A$00, the list becomes $\mathcal A$01, $\mathcal A$02, and $\mathcal A$03 (Cuntz et al., 2017). For irreducible supersolvable simplicial arrangements of rank $\mathcal A$04, supersolvability forces crystallographicity (Cuntz et al., 2017).

Rank $\mathcal A$05 line arrangements also exhibit a geometry specific to modular points. If $\mathcal A$06 is full-rank and supersolvable with $\mathcal A$07 lines, then the number $\mathcal A$08 of simple intersection points satisfies

$\mathcal A$09

(Anzis et al., 2015). Over $\mathcal A$10, the analogous supersolvable Dirac–Motzkin statement is presented as a conjecture in that work, verified there for all supersolvable arrangements with $\mathcal A$11 (Anzis et al., 2015).

Dimca–Sticlaru introduced the nearby notion of a nearly supersolvable line arrangement. A line arrangement in $\mathcal A$12 is supersolvable if and only if it has a modular point; it is nearly supersolvable if it is not supersolvable but has a nearly modular point $\mathcal A$13, with a unique exceptional double point $\mathcal A$14, and adding the line $\mathcal A$15 produces a supersolvable arrangement (Dimca et al., 2017). Their main theorem states that every nearly supersolvable arrangement is either free or nearly free, with the precise dichotomy governed by the multiplicity $\mathcal A$16 of the nearly modular point:

• if $\mathcal A$17, then $\mathcal A$18 and the arrangement is nearly free with exponents $\mathcal A$19;
• if $\mathcal A$20, then $\mathcal A$21 and the arrangement is free with exponents $\mathcal A$22 (Dimca et al., 2017).

5. Algebraic interfaces: Orlik–Solomon theory, broken circuits, and Koszulity

Supersolvability has strong algebraic repercussions for Orlik–Solomon, Orlik–Terao, and Varchenko–Gel'fand type algebras.

For ordered matroids with pairwise disjoint minimal broken circuits, Le and Römer proved that the following are equivalent: complete factorization of the Poincaré polynomial of the Orlik–Solomon algebra over $\mathcal A$23, the condition that all relevant circuit sizes satisfy $\mathcal A$24, supersolvability of the matroid, and Koszulity of the Orlik–Solomon algebra (Dinh et al., 2012). In the corresponding realizable case, when minimal broken circuits are pairwise disjoint, one also has

$\mathcal A$25

for the Orlik–Solomon algebra $\mathcal A$26 and the Orlik–Terao ideal $\mathcal A$27 (Dinh et al., 2012).

For root-ideal arrangements, Hultman identified the precise obstruction to extending this equivalence: $\mathcal A$28 is supersolvable if and only if it is line-closed, if and only if its Orlik–Solomon algebra is Koszul (Hultman, 2014). The minimal non-supersolvable ideals are essentially two: one in type $\mathcal A$29 and one in type $\mathcal A$30 (Hultman, 2014).

A different but related direction studies graded representation theory. For a simple central supersolvable arrangement $\mathcal A$31 of rank $\mathcal A$32 with exponent-multiplicities $\mathcal A$33, the Hilbert series of the Orlik–Solomon algebra and the Varchenko–Gel'fand algebra satisfy

$\mathcal A$34

(Almousa et al., 2024). In the supersolvable case, the quadratic subsets of the defining relations form Gröbner bases for both algebras, and hence these algebras are Koszul (Almousa et al., 2024). For the braid arrangement, these Hilbert series are governed by signless Stirling numbers of the first kind, while the Koszul dual Hilbert series is governed by Stirling numbers of the second kind (Almousa et al., 2024).

These results make clear that supersolvability is not only a lattice condition. It is also a mechanism by which circuit combinatorics becomes sufficiently rigid to force quadraticity, Gröbner-basis control, and explicit Hilbert-series product formulas.

6. Chamber combinatorics, topology, and contemporary extensions

For real supersolvable arrangements, the chamber structure is unusually well behaved. If $\mathcal A$35 is a chamber incident to a full modular flag, Reading proved that the chamber poset $\mathcal A$36, ordered by inclusion of separation sets from $\mathcal A$37, is a lattice (McConville, 2014). McConville sharpened the classical biconvex/separable correspondence by proving that for supersolvable arrangements, biclosed subsets of hyperplanes are exactly the separation sets of chambers. Moreover, for chambers $\mathcal A$38,

$\mathcal A$39

in the chamber lattice (McConville, 2014). This replaces global convexity by the weaker local $\mathcal A$40-closure condition.

Recent work has translated the same recursive supersolvable structure into explicit Hamiltonicity statements. Every supersolvable hyperplane arrangement has a Hamiltonian cycle in its tope graph, and more generally every supersolvable oriented matroid has a Hamiltonian tope graph (Körber et al., 20 Aug 2025). Independently, supersolvable arrangements in $\mathcal A$41 have Hamiltonian cycles in their region graphs $\mathcal A$42, obtained by a zig–zag induction along the recursive decomposition $\mathcal A$43 (Brenner et al., 18 Jul 2025). For a canonical base region $\mathcal A$44, any lattice congruence quotient of the region lattice $\mathcal A$45 has a cover graph with a Hamiltonian path (Brenner et al., 18 Jul 2025).

The topological analogue of these recursive constructions appears in abelian arrangements. Bibby and Delucchi generalized Stanley’s notion from geometric lattices to locally geometric posets via $\mathcal A$46-ideals and proved that an essential abelian arrangement is fiber-type if and only if its poset of layers is supersolvable in this generalized sense (Bibby et al., 2022). Under strict supersolvability assumptions, the characteristic polynomial factors completely, the complement is a $\mathcal A$47, and in the noncompact case the Poincaré polynomial factors as

$\mathcal A$48

(Bibby et al., 2022). In toric arrangements this yields a Falk–Randell type lower-central-series formula (Bibby et al., 2022).

These developments suggest that supersolvability is best viewed as a transference principle: a modular chain in the incidence structure induces recursion in topology, chamber combinatorics, representation theory, and Gray-code style generation.

7. Examples, criteria, and open directions

Several standard examples illustrate the breadth of the theory. The braid arrangement $\mathcal A$49, with hyperplanes $\mathcal A$50, is supersolvable and admits an explicit modular chain given by the subspaces where the first $\mathcal A$51 coordinates coincide (Hoge et al., 2012). The hyperoctahedral arrangement $\mathcal A$52, with hyperplanes $\mathcal A$53 and $\mathcal A$54, is likewise supersolvable and carries a chain obtained by successively setting coordinates equal to zero (Hoge et al., 2012). For the path graph $\mathcal A$55, the connected-subgraph arrangement is the braid arrangement in disguise and is therefore supersolvable with

$\mathcal A$56

and exponents $\mathcal A$57 (Cuntz et al., 2022).

Equally instructive are nonexamples. Reflection arrangements of type $\mathcal A$58 for $\mathcal A$59 are not supersolvable (1311.0620). Cycle graphs $\mathcal A$60 produce connected-subgraph arrangements that may be free but are not supersolvable (Cuntz et al., 2022). The full monomial example

$\mathcal A$61

is free with exponents $\mathcal A$62, but has no modular point when $\mathcal A$63 (Dimca et al., 2017). These examples emphasize that freeness and supersolvability, though tightly linked, are distinct.

Several open directions are explicitly recorded in the cited work. The “one $\mathcal A$64” conjecture for free arrangements with exponents consisting of $\mathcal A$65’s, $\mathcal A$66’s, and exactly one $\mathcal A$67 is unresolved in arbitrary rank without the inductive-freeness assumption (Tohaneanu, 2017). In the simplicial field, the classification of supersolvable arrangements is complete, but the broader classification of simplicial arrangements remains open (Cuntz et al., 2017). In the line-arrangement setting over $\mathcal A$68, the supersolvable form of the Dirac–Motzkin inequality remains conjectural beyond the verified small cases (Anzis et al., 2015). For generalized region-lattice quotients, the conjecture highlighted in the Hamiltonicity work asks whether every lattice congruence of an arbitrary region lattice is polytopal (Brenner et al., 18 Jul 2025).

Taken together, these results depict supersolvable hyperplane arrangements as one of the most rigid and best-structured classes in arrangement theory: broad enough to include major families such as chordal graphical arrangements, reflection arrangements of types $\mathcal A$69, $\mathcal A$70, and $\mathcal A$71, and many root-ideal arrangements, yet restrictive enough to admit precise combinatorial tests, classification theorems, and explicit algebraic and topological formulas.