Nice Partitions, Supersolvability, and Freeness in Deformations of Graphic Arrangements
Abstract
We study affine deformations ๐(G๐ฎ) of graphic arrangements and their cones. Here G=([n],E(G)) is a simple graph, ๐ฎ=(Sij) is a family of finite gain sets, and ๐(G๐ฎ) consists of the hyperplanes xiโxj=a with aโ Sij. We call G๐ฎ blockwise admissible if every block has a vertex ordering v1,โฆ,vm satisfying SvkvjโSvkviโ Svivj for every k and all distinct i,j>k. Every such ordering is a perfect elimination ordering. We prove, for arbitrary G, that the following are equivalent: (i) G๐ฎ is blockwise admissible; (ii) the cone c๐(G๐ฎ) is supersolvable; and (iii) ๐(G๐ฎ) admits a nice partition. We give a direct arrangement-theoretic proof of these equivalences. For a block, the equivalence between admissibility and supersolvability is already contained in Zaslavsky's characterization of supersolvable graphic-lift lattices. We further show that every nice partition on a block is induced by an admissible ordering and that its induced edge classes are stars with distinct centers. Under these equivalent conditions, we construct a maximal modular chain through the hyperplane at infinity. We also prove that if c๐(G๐ฎ) is free, then G is chordal.
Related
- Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations
- Equivalence of freeness and higher order freeness of hyperplane arrangements
- Freeness of Arrangements with Regular Underlying Matroids
- Deformations, local freeness, and base change for higher Du Bois singularities
- Terao's freeness conjecture for arrangements of 15 and 16 lines
BibTeX
@misc{liang2026nice,
title = {{Nice Partitions, Supersolvability, and Freeness in Deformations of Graphic Arrangements}},
author = {Weikang Liang and Suijie Wang and Yue Zhou},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39407},
eprint = {2609.39407},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39407},
}
RIS
TY - UNPB
TI - Nice Partitions, Supersolvability, and Freeness in Deformations of Graphic Arrangements
AU - Weikang Liang
AU - Suijie Wang
AU - Yue Zhou
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39407
UR - https://arxiv.org/abs/2609.39407
AB - We study affine deformations ๐(G_๐ฎ) of graphic arrangements and their cones. Here G=([n],E(G)) is a simple graph, ๐ฎ=(S_ij) is a family of finite gain sets, and ๐(G_๐ฎ) consists of the hyperplanes x_iโx_j=a with aโ S_ij. We call G_๐ฎ blockwise admissible if every block has a vertex ordering v_1,โฆ,v_m satisfying S_v_kv_jโS_v_kv_iโ S_v_iv_j for every k and all distinct i,j>k. Every such ordering is a perfect elimination ordering. We prove, for arbitrary G, that the following are equivalent: (i) G_๐ฎ is blockwise admissible; (ii) the cone c๐(G_๐ฎ) is supersolvable; and (iii) ๐(G_๐ฎ) admits a nice partition. We give a direct arrangement-theoretic proof of these equivalences. For a block, the equivalence between admissibility and supersolvability is already contained in Zaslavsky's characterization of supersolvable graphic-lift lattices. We further show that every nice partition on a block is induced by an admissible ordering and that its induced edge classes are stars with distinct centers. Under these equivalent conditions, we construct a maximal modular chain through the hyperplane at infinity. We also prove that if c๐(G_๐ฎ) is free, then G is chordal.
ER -