Skip to content
DraconiticResearch
Search Sources API
197,783 studies31 sourcesUpdated 46 min ago
PreprintarXiv licencearXiv

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

  1. Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations
    Weikang Liang, Suijie Wang, Yue Zhou
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Equivalence of freeness and higher order freeness of hyperplane arrangements
    Takuro Abe
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. Freeness of Arrangements with Regular Underlying Matroids
    Weikang Liang, Suijie Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Deformations, local freeness, and base change for higher Du Bois singularities
    Haoming Ning
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Terao's freeness conjecture for arrangements of 15 and 16 lines
    Cristian Anghel, RareลŸ Stan
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
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  -