English

Inductive and divisional posets

Combinatorics 2024-01-09 v2

Abstract

We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their superclass of divisional posets. It then motivates us to define the so-called inductive and divisional abelian (Lie group) arrangements, whose posets of layers serve as the main examples of our posets. Our first main result is that every divisional poset is factorable. Our second main result shows that the class of inductive posets contains strictly supersolvable posets, the notion recently introduced due to Bibby and Delucchi (2022). This result can be regarded as an extension of a classical result due to Jambu and Terao (1984), which asserts that every supersolvable hyperplane arrangement is inductively free. Our third main result is an application to toric arrangements, which states that the toric arrangement defined by an arbitrary ideal of a root system of type AA, BB or CC with respect to the root lattice is inductive.

Keywords

Cite

@article{arxiv.2304.08145,
  title  = {Inductive and divisional posets},
  author = {Roberto Pagaria and Maddalena Pismataro and Tan Nhat Tran and Lorenzo Vecchi},
  journal= {arXiv preprint arXiv:2304.08145},
  year   = {2024}
}

Comments

28 pages, typos in Acknowledgments corrected

R2 v1 2026-06-28T10:08:06.629Z