Crystallographic Arrangements in Hyperplane Theory

• Crystallographic arrangements are finite real hyperplane configurations where every chamber is a simplicial cone and the defining covectors satisfy an integrality condition mimicking root systems.
• They are classified via a bijection with connected simply connected Cartan schemes and finite Weyl groupoids, ensuring only finitely many equivalence classes exist in each rank above two.
• These arrangements exhibit strong properties such as inductive freeness, supersolvability, and combinatorial Hamiltonicity, linking geometric, algebraic, and combinatorial theories.

Searching arXiv for recent and foundational papers on crystallographic arrangements. arxiv_search(query="crystallographic arrangements hyperplane arrangements Weyl groupoids", max_results=10, sort_by="relevance") arxiv_search: crystallographic arrangements hyperplane arrangements Weyl groupoids Crystallographic arrangements are a class of finite real hyperplane arrangements characterized by two simultaneous features: the arrangement is simplicial, so every chamber is an open simplicial cone, and its defining covectors satisfy a chamberwise integrality condition that makes the arrangement behave like a root system attached to a finite Weyl groupoid. In this sense, crystallographic arrangements form an arrangement-theoretic analogue of crystallographic root systems in Lie theory. They constitute a large subclass of simplicial arrangements, admit a complete classification, and are linked to Weyl groupoids, restrictions of Weyl arrangements, freeness phenomena, supersolvability, and several related constructions in reflection-group theory (Cuntz, 2010, Barakat et al., 2010).

1. Definition and chamber structure

Let $V=\mathbb{R}^r$ and let $\mathcal A$ be a finite set of linear hyperplanes in $V$. The arrangement is simplicial if every connected component of

$V\setminus \bigcup_{H\in\mathcal A} H$

is an open simplicial cone; these components are the chambers. If $K$ is a chamber and $B_K$ denotes the set of inward-pointing normal vectors of its walls, then a crystallographic arrangement is defined by the requirement that every root lies in the integer span of $B_K$ for every chamber: $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$ In one standard convention one uses a symmetric root set $R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$; in another one chooses one representative on each root line and imposes $R\cap \mathbb R\alpha=\{\alpha\}$ for all $\mathcal A$0 (Cuntz, 2010, Barakat et al., 2010).

This integrality axiom is the decisive strengthening over arbitrary simplicial arrangements. It implies that for every chamber $\mathcal A$1, the roots decompose into positive and negative parts relative to the basis $\mathcal A$2, and every root is either a nonnegative or nonpositive integral combination of the chamber basis vectors. The same framework admits an equivalent “additive” formulation: every non-simple positive root is a sum of two positive roots. That equivalence gives a combinatorially accessible reformulation of crystallographicity (Cuntz, 2010).

A central local fact is that passage between adjacent chambers is reflection-like. If $\mathcal A$3 and $\mathcal A$4 share a wall, then one simple root changes sign while the others change by adding nonnegative multiples of the crossing root; in the notation of adjacent bases this appears as

$\mathcal A$5

Accordingly, each chamber carries a Cartan-like matrix $\mathcal A$6 defined by

$\mathcal A$7

This gives crystallographic arrangements a chamberwise Cartan structure without requiring a single global Weyl group (Cuntz, 2010, Cuntz, 2019).

2. Weyl groupoids, classification, and finiteness

The foundational structural theorem is a bijection between crystallographic arrangements and connected simply connected Cartan schemes whose real roots form a finite root system. More precisely, crystallographic arrangements up to linear equivalence correspond one-to-one to connected simply connected Cartan schemes with finite real-root systems, up to equivalence of Cartan schemes. This identifies crystallographic arrangements as the concrete geometric realization of finite Weyl groupoids (Cuntz, 2010).

That correspondence leads directly to classification. The irreducible connected simply connected Cartan schemes with finite irreducible real root systems fall into three classes: rank-$\mathcal A$8 families parametrized by triangulations of a convex polygon; for each rank $\mathcal A$9, the standard types $V$0 together with $V$1 additional infinite families; and $V$2 sporadic schemes, including $V$3. Reflection arrangements from Weyl groups are examples of crystallographic arrangements, and for irreducible simplicial $V$4-arrangements with $V$5, crystallographicity is equivalent to being a restriction of an irreducible Weyl arrangement (Barakat et al., 2010, Cuntz et al., 2017).

A later finiteness theorem gives a conceptual explanation for why the classification terminates. For every rank $V$6, there are only finitely many equivalence classes of irreducible crystallographic arrangements. The proof is computer-free and proceeds through local rank-$V$7 and rank-$V$8 control, a uniform Cartan-entry bound

$V$9

a bound on rank-$V\setminus \bigcup_{H\in\mathcal A} H$0 localizations in rank $V\setminus \bigcup_{H\in\mathcal A} H$1, and a global bound on pairwise root volumes $V\setminus \bigcup_{H\in\mathcal A} H$2 (Cuntz, 2019).

This finiteness result is significant because the earlier complete classification relied on computer checks of millions of cases, whereas the finiteness theorem shows abstractly that only finitely many irreducible arrangements can occur in each rank $V\setminus \bigcup_{H\in\mathcal A} H$3. A plausible implication is that crystallographic arrangements occupy a sharply constrained region inside the much broader and less tractable class of simplicial arrangements (Cuntz, 2019).

3. Freeness, inductive freeness, and supersolvable simplicial arrangements

Crystallographic arrangements enjoy strong freeness properties. Using the classification of finite Weyl groupoids, it was proved that crystallographic arrangements are inductively free, hence hereditarily inductively free. Since restrictions of crystallographic arrangements remain crystallographic, every restriction to an intersection again lies in the same class and is inductively free. In particular, all crystallographic reflection arrangements are hereditarily inductively free, including the arrangement of type $V\setminus \bigcup_{H\in\mathcal A} H$4 (Barakat et al., 2010).

The relevant recursive framework is the addition–deletion theory of arrangements. For a triple $V\setminus \bigcup_{H\in\mathcal A} H$5, with $V\setminus \bigcup_{H\in\mathcal A} H$6 and $V\setminus \bigcup_{H\in\mathcal A} H$7, freeness and exponent containment propagate through the standard addition–deletion theorem. Inductive freeness is the smallest class generated from the empty arrangement by repeated application of this criterion, and hereditary inductive freeness means that every restriction belongs to that class (Barakat et al., 2010).

Supersolvability interacts with crystallographicity in a particularly rigid way. Irreducible supersolvable simplicial arrangements are completely classified. In rank $V\setminus \bigcup_{H\in\mathcal A} H$8, they are exactly the two infinite families $V\setminus \bigcup_{H\in\mathcal A} H$9 and $K$0. In rank $K$1, the only possibilities are

$K$2

and for rank $K$3 the same pattern persists: $K$4 Consequently, every irreducible supersolvable simplicial arrangement is crystallographic (Cuntz et al., 2017).

The method in this classification is the Coxeter graph of a chamber, whose vertices correspond to chamber walls and whose labeled edges record rank-$K$5 multiplicities. In high rank, the graph-theoretic restrictions are so strong that supersolvability forces a “strong integrality property,” namely crystallographicity. This is one of the clearest instances in which a lattice-theoretic condition on the intersection poset implies a chamberwise root-system structure (Cuntz et al., 2017).

4. Root ideal arrangements and algebraic consequences

A particularly important subclass arises from finite crystallographic root systems. If $K$6 is a finite crystallographic root system with positive roots $K$7, and $K$8 is an order ideal in the root poset, then the associated root ideal arrangement is

$K$9

These are subarrangements of Weyl arrangements, and their structure is controlled by the combinatorics of the root poset (Hultman, 2014).

The central classification theorem in this setting states: $B_K$0 Here chain peelability means that one can recursively remove maximal chains that are also order filters. This turns a geometric property of the arrangement into a purely poset-theoretic one. An immediate consequence is that supersolvability is preserved under taking subideals (Hultman, 2014).

The minimal obstructions are highly specific. In simply laced types, the obstruction is the $B_K$1 “star ideal,” and in type $B_K$2 it is the special ideal $B_K$3 generated by

$B_K$4

Accordingly, all ideals in type $B_K$5 are supersolvable; in types $B_K$6 and $B_K$7, supersolvability fails precisely when the ideal contains the unique minimal star ideal; in types $B_K$8, every ideal is supersolvable; and in type $B_K$9, supersolvability fails precisely when the ideal contains $B_K$0 (Hultman, 2014).

The Orlik–Solomon algebra of a root ideal arrangement exhibits a parallel dichotomy. For these arrangements,

$B_K$1

Thus the minimal forbidden ideals control not only supersolvability but also the Koszul property. This places crystallographic root ideal arrangements at a notable intersection of arrangement combinatorics, cohomology algebras, and quadraticity phenomena (Hultman, 2014).

5. Restrictions, tope graphs, and Hamiltonian structure

Crystallographic arrangements also have a strong region-graph theory. For a central arrangement $B_K$2, the tope graph has regions as vertices, equivalently sign vectors, and edges joining regions that differ by crossing exactly one hyperplane. A Hamiltonian cycle in this graph gives a Gray-code ordering of the regions: consecutive regions differ in exactly one sign (Körber et al., 20 Aug 2025).

A recent theorem states that all restrictions of reflection arrangements admit a Hamiltonian cycle in their tope graphs. Since crystallographic arrangements occur among the restrictions of reflection arrangements, this immediately covers all finite connected Weyl groupoids and crystallographic arrangements in dimension $B_K$3 and above. The crystallographic case is therefore not isolated by a specialized proof; it is obtained uniformly through the structure theory of restrictions (Körber et al., 20 Aug 2025).

The proof uses two structural mechanisms. First, if $B_K$4 is obtained from $B_K$5 by deleting hyperplanes, then the tope graph of $B_K$6 is obtained from that of $B_K$7 by contracting exactly the edges whose types belong to the deleted hyperplanes. Second, Hamiltonian cycles can be glued across a quadrilateral $B_K$8 connecting two induced subgraphs. Together these observations allow induction from reflection arrangements to their restrictions and, separately, to supersolvable arrangements and supersolvable oriented matroids (Körber et al., 20 Aug 2025).

This Hamiltonicity result complements the freeness and supersolvability theory. It shows that crystallographic arrangements are not only algebraically rigid but also combinatorially traversable in a Gray-code sense. A plausible implication is that the same chamberwise integrality which underlies Weyl-groupoid structure also imposes enough combinatorial regularity to support global Hamiltonian behavior in the region graph (Körber et al., 20 Aug 2025).

6. Affine and complex-reflection analogues

A related, but distinct, theory concerns crystallographic complex reflection groups. These are infinite affine complex reflection groups acting on $B_K$9, generated by reflections across affine hyperplanes, and typically of the form

$R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$0

where $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$1 is a finite complex reflection group and $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$2 is a $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$3-invariant lattice of full rank $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$4. A group is crystallographic in this setting when $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$5 is compact; equivalently for irreducible infinite affine reflection groups, the translation subgroup is a full-rank lattice (Puente et al., 2018).

The geometric link to arrangement theory is direct: the reflecting hyperplanes of $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$6 form an affine hyperplane arrangement, and the analogue of Steinberg’s fixed-point theorem asks whether the nonregular points are exactly the union of these reflecting hyperplanes. The paper formalizes this as the Steinberg property. It holds for finite reflection groups and affine Weyl groups, but not for all crystallographic complex reflection groups (Puente et al., 2018).

For the genuine $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$7-based families, the classification is explicit. If $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$8 is not a Coxeter group and $R \subseteq \sum_{\alpha\in B_K}\mathbb Z\,\alpha.$9, then the nonregular points are the union of reflecting affine hyperplanes if and only if

$R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$0

and

$R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$1

Equivalently, in the genuine infinite family, the Steinberg property holds precisely for

$R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$2

$R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$3

For crystallographic groups whose linear part is the complexification of a finite Coxeter group, the Steinberg property holds exactly for

$R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$4

The failure cases include $R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$5, $R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$6, and $R=\{\pm x_1,\dots,\pm x_n\}\subset V^*$7 (Puente et al., 2018).

This affine complex theory should not be conflated with finite real crystallographic arrangements, but the analogy is informative. In both settings, chamber or orbit regularity is governed by the interaction between reflection hyperplanes and an integrality datum: in the real theory this datum is encoded chamberwise in the root lattice, while in the complex affine theory it is encoded by the translation lattice and the positions of translated mirrors (Puente et al., 2018).