Skip to content
DraconiticResearch
Search Sources API
189,280 studies31 sourcesUpdated 44 min ago
PreprintarXiv licencearXiv

Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations

  • Weikang Liang
  • Suijie Wang
  • Yue Zhou
Open at sourcePDFDOICite

Abstract

Nice partitions of hyperplane arrangements give tensor factorizations of Orlik-Solomon algebras as graded vector spaces. In general, a hyperplane arrangement admitting a nice partition need not be free. In this paper, we consider signed-graphic arrangements, the subarrangements of type-B Weyl arrangements, over fields of characteristic different from $2$. We prove that every nice partition of a signed-graphic arrangement is an inductive factorization and hence that the arrangement is free, with nonzero exponents given by the part sizes. In particular, Terao's conjecture holds for the intersection lattices of signed-graphic arrangements admitting a nice partition.

Related

  1. Nice Partitions, Supersolvability, and Freeness in Deformations of Graphic Arrangements
    Weikang Liang, Suijie Wang, Yue Zhou
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Sufficiency of Hall's Condition for Graphic List Coloring
    Parikshit Chalise
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Graphic matroids with connectivity constraints
    Will J. Turner
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. TASTE: A Designer-Annotated Multi-Dimensional Preference Dataset for AI-Generated Graphic Design
    Haonan Zhu, Elad Hirsch, Alexandria Minetti +3
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Graphic additive bases and graph flows
    Amir Jafari
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{liang2026nice,
  title = {{Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations}},
  author = {Weikang Liang and Suijie Wang and Yue Zhou},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.38412},
  eprint = {2610.38412},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.38412},
}
RIS
TY  - UNPB
TI  - Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations
AU  - Weikang Liang
AU  - Suijie Wang
AU  - Yue Zhou
PY  - 2026
DA  - 2026/10/28
PB  - arXiv
DO  - 10.48550/arxiv.2610.38412
UR  - https://arxiv.org/abs/2610.38412
AB  - Nice partitions of hyperplane arrangements give tensor factorizations of Orlik-Solomon algebras as graded vector spaces. In general, a hyperplane arrangement admitting a nice partition need not be free. In this paper, we consider signed-graphic arrangements, the subarrangements of type-B Weyl arrangements, over fields of characteristic different from $2$. We prove that every nice partition of a signed-graphic arrangement is an inductive factorization and hence that the arrangement is free, with nonzero exponents given by the part sizes. In particular, Terao's conjecture holds for the intersection lattices of signed-graphic arrangements admitting a nice partition.
ER  -