Metraipolis › archive › dc_5f3ce408342f

Visibility Sets, Empty Pentagons, and Sufficient Conditions for Hexagons — arXiv:2610.23553

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.23553
License (as archived)
CC0-1.0
Archived
2026-10-19T09:39:27.047Z
SHA-256 of the archived text
ea24e0713cb462f0cd59113228adb76ba416483ca210e2bb594b6e9c9fc77fc4
Stable URL of this page
https://metraipolis.com/documento/dc_5f3ce408342f

How to cite

Visibility Sets, Empty Pentagons, and Sufficient Conditions for Hexagons — arXiv:2610.23553 — arXiv (en), https://arxiv.org/abs/2610.23553 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5f3ce408342f (Metraipolis archive dc_5f3ce408342f, sha256 ea24e0713cb462f0cd59113228adb76ba416483ca210e2bb594b6e9c9fc77fc4)
BibTeX
@misc{dc5f3ce408342f,
  title = {Visibility Sets, Empty Pentagons, and Sufficient Conditions for Hexagons — arXiv:2610.23553},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.23553},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5f3ce408342f; sha256 ea24e0713cb462f0cd59113228adb76ba416483ca210e2bb594b6e9c9fc77fc4},
  year = {2026}
}

Archived text

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

Given a set $S$ of $n$ points in general position in the plane, we define the $C$-set $C(p,q)$ of an oriented edge $(p,q)$ as the set of extreme points of the visibility set $V(p,q)$ facing $(p,q)$. Since every point of $V(p,q)$ that is not in $C(p,q)$ gives rise to an empty convex pentagon having $(p,q)$ as a boundary edge, it is natural to study the properties of $C$-sets in order to bound the number of empty convex pentagons of $S$. We prove tight bounds on the intersection size and union complexity of $C$-sets sharing an endpoint. We also consider the problem of bounding the number of empty pentagons and hexagons in terms of the number of interior and boundary points of $S$. While the hexagon bound is weak, it offers a potential step toward a superlinear lower bound. On the other hand, the two-parameter bound for pentagons, combined with the structural results on $C$-sets, yields a simple proof of an $\Omega(n^{3/2})$ bound for the number of pentagons. While this is a significant improvement over previously published bounds, a recent preprint \cite{Astudillo2026} attains a better bound using completely different methods. Thus, the primary contribution of this paper lies in the structural results about $C$-sets and the two-parameter bounds for empty pentagons and hexagons.

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/2610.23553 — 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-10-19T09:34:59.751Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).