Non-simple Arrangements of Lines and Pseudolines with Many Triangles
math.CO, cs.CG
Submitted: 2026-11-02
Updated: 2026-11-02
Comments: 72 pages, 19 figures, 8 tables. Code, enumeration outputs and certificates: https://github.com/parpalak/nonsimple-arrangements
Code: https://github.com/parpalak/nonsimple-arrangements
Project page: https://ud1.github.io
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Enumeration and Classification of Triangle-Maximal Pseudoline Arrangements
- Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
- The $18\cdot 2^t+1$ Triangle-Maximal Series of Straight Lines
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality