PreprintCC BY 4.0arXiv
A base-$8$ upper bound for planar peeling sequences
Abstract
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 g(n) ≤ (8+o(1))n.
Related
- Lebesgue constants of Leja sequences: a universal lower bound and improved upper bounds on the real line.
- Peeling sequences: a directional method for the three-block construction
- Generalized upper principal part of real planar polynomial vector fields
- A Sharp Distributional Lower Bound for Planar Discrepancy
- A Peierls bound for planar soft-stick percolation
BibTeX
@misc{hisatsuga2026base8,
title = {{A base-$8$ upper bound for planar peeling sequences}},
author = {André Hisatsuga and Griffin Johnston and Rafael Miyazaki},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.13122},
eprint = {2609.13122},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.13122},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - A base-$8$ upper bound for planar peeling sequences
AU - André Hisatsuga
AU - Griffin Johnston
AU - Rafael Miyazaki
PY - 2026
DA - 2026/09/11
PB - arXiv
DO - 10.48550/arxiv.2609.13122
UR - https://arxiv.org/abs/2609.13122
AB - 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 g(n) ≤ (8+o(1))^n.
ER -