On combinatorics of plus-one generated line arrangements
Artur Bromboszcz

TL;DR
This paper explores the combinatorial properties of plus-one generated line arrangements, providing constraints, a decoding polynomial, and new examples, including classical and sporadic arrangements, to advance understanding of their structure.
Contribution
It introduces combinatorial constraints, a decoding polynomial, and identifies minimal plus-one generated arrangements among known sporadic examples.
Findings
Identified 9 minimal plus-one generated arrangements among known sporadic simplicial arrangements.
Constructed new examples using Klein and Wiman reflection arrangements.
Provided a polynomial that decodes the plus-one generated property.
Abstract
In this note we focus on combinatorial aspects of plus-one generated line arrangements. We provide combinatorial constraints on such arrangements and we construct a polynomial that decodes the plus-one generated property. We present new examples of plus-one generated arrangements constructed by using classical Klein and Wiman reflection arrangements, and we detect, among all known sporadic simplicial arrangements up to lines, exactly arrangements that are minimal plus-one generated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Combinatorial Mathematics · Advanced Mathematical Theories
