Metraipolis › archive › dc_ab37bcf1d5fd
A base-$8$ upper bound for planar peeling sequences — arXiv:2609.13122
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13122
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T03:49:26.638Z
- SHA-256 of the archived text
146f10d35a9ebe4a1ba4065125455ac7491bebdb6017047f00883b67efee1150- Stable URL of this page
https://metraipolis.com/documento/dc_ab37bcf1d5fd
How to cite
A base-$8$ upper bound for planar peeling sequences — arXiv:2609.13122 — arXiv (en), https://arxiv.org/abs/2609.13122 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ab37bcf1d5fd (Metraipolis archive dc_ab37bcf1d5fd, sha256 146f10d35a9ebe4a1ba4065125455ac7491bebdb6017047f00883b67efee1150)
BibTeX
@misc{dcab37bcf1d5fd,
title = {A base-$8$ upper bound for planar peeling sequences — arXiv:2609.13122},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13122},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ab37bcf1d5fd; sha256 146f10d35a9ebe4a1ba4065125455ac7491bebdb6017047f00883b67efee1150},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13122. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $g(n)$ denote the minimum number of peeling sequences among all $n$-point sets in general position in the plane. Dumitrescu and Tóth proved an exponential upper bound with base $12.29$, and Simon subsequently lowered the base to $9.78$. Using the same recursive construction, we prove \begin{equation*} g(n) \le (8+o(1))^n. \end{equation*}
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.13122 — 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-16T03:18:59.224Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).