On arrangements of hyperplanes from connected subgraphs
In the paper under review the authors study a new class of hyperplane arrangements associated with graphs, namely \textit{connected subgraph arrangements}. Given a graph \(G\) on \(n\) vertices, the arrangement \(\mathcal{A}_G\) consists of all hyperplanes whose defining normal vectors are characteristic vectors of vertex sets inducing connected subgraphs. This construction interpolates naturally between well-known examples such as the braid arrangement (path graphs) and the resonance (all-subsets) arrangement.\N\NThe main contribution is a complete classification of freeness within this class. The authors prove that \(\mathcal{A}_G\) is free if and only if \(G\) belongs to one of four explicit families: paths, cycles, almost-path graphs, or path-with-triangle graphs. The proof combines structural graph arguments with techniques from the theory of arrangements, including addition-deletion, the multiple addition theorem (MAT), and localization methods.\N\NBeyond freeness, the paper also classifies when these arrangements are simplicial, factored, or supersolvable. In particular, simplicial arrangements arise only for paths and triangles, while supersolvability occurs precisely for paths. These results highlight a strong rigidity phenomenon linking combinatorial graph structure to arrangement-theoretic properties. The work also discusses connections to Weyl arrangements and Shi arrangements, and formulates open problems concerning \(K(\pi,1)\)-properties and characteristic polynomials.
- A catalogue of simplicial arrangements in the real projective plane
- A formula for the characteristic polynomial of an arrangement
- A greedy algorithm to compute arrangements of lines in the projective plane
- Arrangements of ideal type are inductively free
- Combinatorial simpliciality of arrangements of hyperplanes
- Computing characteristic polynomials of hyperplane arrangements with symmetries
- Crystallographic arrangements: Weyl groupoids and simplicial arrangements.
- Factorizations of the Orlik-Solomon algebras
- Finite Weyl groupoids
- Freeness of hyperplane arrangements and related topics
- scientific article; zbMATH DE number 52944 (Why is no real title available?)
- scientific article; zbMATH DE number 3803606 (Why is no real title available?)
- Les immeubles des groupes de tresses généralises
- MAT-free reflection arrangements
- On complex supersolvable line arrangements
- On Formality and Combinatorial Formality for hyperplane arrangements
- On free deformations of the braid arrangement
- On the homotopy theory of arrangements. II
- Simplicial arrangements with up to 27 lines
- Supersolvable lattices
- Supersolvable simplicial arrangements
- The freeness of ideal subarrangements of Weyl arrangements
- The Kazhdan-Lusztig cells in certain affine Weyl groups
- The universality of the resonance arrangement and its Betti numbers
- Topology of Factored Arrangements of Lines
This page was built for publication: On arrangements of hyperplanes from connected subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865436)
