Metraipolis › archive › dc_47bd3d36153e

Non-simple Arrangements of Lines and Pseudolines with Many Triangles — arXiv:2611.03096

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03096
License (as archived)
CC0-1.0
Archived
2026-11-03T11:37:38.636Z
SHA-256 of the archived text
7b548ae6860cfbab7499430a56f3784e8ff42801d6d584e6c19136360bc7ce6f
Stable URL of this page
https://metraipolis.com/documento/dc_47bd3d36153e

How to cite

Non-simple Arrangements of Lines and Pseudolines with Many Triangles — arXiv:2611.03096 — arXiv (en), https://arxiv.org/abs/2611.03096 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_47bd3d36153e (Metraipolis archive dc_47bd3d36153e, sha256 7b548ae6860cfbab7499430a56f3784e8ff42801d6d584e6c19136360bc7ce6f)
BibTeX
@misc{dc47bd3d36153e,
  title = {Non-simple Arrangements of Lines and Pseudolines with Many Triangles — arXiv:2611.03096},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03096},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_47bd3d36153e; sha256 7b548ae6860cfbab7499430a56f3784e8ff42801d6d584e6c19136360bc7ce6f},
  year = {2026}
}

Archived text

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

We study affine arrangements of an even number $n$ of lines and pseudolines with many triangles. For simple ones, Blanc's bound limits the number of triangular faces to $\lfloor n(n-5/2)/3\rfloor$. Adapting the Bartholdi-Blanc-Loisel doubling to the even case, we construct an infinite series of arrangements of $n=6\cdot2^t+2$ ($8,14,26,50,\ldots$) straight lines with two triple points and $(n(n-5/2)+1)/3$ triangles, one more than the simple bound allows. We obtain exhaustive enumerations of triangle-maximal pseudoline arrangements, simple or not, for even $n\le12$. For $n=6,8,10,12,14$ the maximum number of triangles, for both lines and pseudolines, is $7,15,25,38,54$; for $n=8,12,14$ every optimal arrangement has multiple points. All optimal arrangements for even $n\le12$ are realizable by straight lines, except two arrangements of 10 pseudolines, which are not stretchable. For the odd value $n=11$, no arrangement with $33$ triangles exists even with multiple points. We also obtain even arrangements by adding a line to odd ones. For $n\equiv2\pmod 6$ this again gives one triangle more than the simple bound, in pseudolines up to $n=44$ and in straight lines for $n=20$ and $n=32$. Doubling these pseudoline arrangements gives members of the series $18\cdot2^t+2$ and $30\cdot2^t+2$ with the same excess, up to $n=146$ and $n=242$, respectively; those with $n=38$ and $n=74$ are realizable by straight lines. These results lead us to conjecture that an arrangement of an even number $n$ of pseudolines has at most $\lfloor n(n-2)/3\rfloor-\lfloor n/6\rfloor$ triangles.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Computational Geometry (cs.CG).
Pagina del lavoro: https://arxiv.org/abs/2611.03096 — 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-03T11:05:22.312Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).