Metraipolis › archive › dc_d31ac0c2d4cb

Peeling sequences: a directional method for the three-block construction — arXiv:2609.19540

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19540
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:02.764Z
SHA-256 of the archived text
2bd153ccd3618aefc9fcdb1a1333ea5764fa8ecd2ebc71140e492529d9694bf9
Stable URL of this page
https://metraipolis.com/documento/dc_d31ac0c2d4cb

How to cite

Peeling sequences: a directional method for the three-block construction — arXiv:2609.19540 — arXiv (en), https://arxiv.org/abs/2609.19540 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d31ac0c2d4cb (Metraipolis archive dc_d31ac0c2d4cb, sha256 2bd153ccd3618aefc9fcdb1a1333ea5764fa8ecd2ebc71140e492529d9694bf9)
BibTeX
@misc{dcd31ac0c2d4cb,
  title = {Peeling sequences: a directional method for the three-block construction — arXiv:2609.19540},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19540},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d31ac0c2d4cb; sha256 2bd153ccd3618aefc9fcdb1a1333ea5764fa8ecd2ebc71140e492529d9694bf9},
  year = {2026}
}

Archived text

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

A \emph{peeling sequence} of a finite planar point set is an ordering of point removals, in which each point is a vertex of the convex hull of the points not yet removed. Write $g(S)$ for the number of such sequences, and $g(n)$ for the minimum of $g(S)$ over $n$-point sets in general position. We present a method which can be used to prove better upper bounds on the previously analysed recursive 3-branch constructions $S_n$. In fact, we prove $g(n)\leq g(S_n)=O(6.57^n)$, using directional restrictions and a weighted prefix-tree argument.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.19540 — 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-10T04:15:33.118Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).