Metraipolis › archive › dc_1c342fd1b60c

Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations — arXiv:2610.38412

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38412
License (as archived)
CC0-1.0
Archived
2026-11-01T02:37:40.822Z
SHA-256 of the archived text
091f8526c141be7be5b584dc9084f4103389f2d38380f4203a9a41d8d4ba710d
Stable URL of this page
https://metraipolis.com/documento/dc_1c342fd1b60c

How to cite

Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations — arXiv:2610.38412 — arXiv (en), https://arxiv.org/abs/2610.38412 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1c342fd1b60c (Metraipolis archive dc_1c342fd1b60c, sha256 091f8526c141be7be5b584dc9084f4103389f2d38380f4203a9a41d8d4ba710d)
BibTeX
@misc{dc1c342fd1b60c,
  title = {Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations — arXiv:2610.38412},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38412},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1c342fd1b60c; sha256 091f8526c141be7be5b584dc9084f4103389f2d38380f4203a9a41d8d4ba710d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38412. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.38412 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:28.248Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).