Abstract
AbstractGiven a set of n labeled points in general position in the plane, we remove all of its points one by one. At each step, one point from the convex hull of the remaining set is erased. In how many ways can the process be carried out? The answer obviously depends on the point set. If the points are in convex position, there are exactly n! ways, which is the maximum number of ways for n points. But what is the minimum number? It is shown that this number is (roughly) at least $$3^n$$
3
n
and at most $$12.29^n$$
12
.
29
n
.
Funder
European Research Council
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
HUN-REN Alfréd Rényi Institute of Mathematics
Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Ambrus, G., Nielsen, P., Wilson, C.: New estimates for convex layer numbers. Discret. Math. 344(7), 112424 (2021)
2. Chazelle, B.: On the convex layers of a planar set. IEEE Trans. Inf. Theory 31(4), 509–517 (1985)
3. Dalal, K.: Counting the onion. Random Struct. Algorithms 24(2), 155–165 (2004)
4. Dumitrescu, A.: Peeling sequences. Mathematics10, 4287 (2022). https://doi.org/10.3390/math10224287. Preprint. arXiv:2211.05968
5. Dumitrescu, A.: Peeling sequences, communication at the joint Budapest Big Combinatorics + Geometry (BBC+G) Seminar, February 2023. https://coge.elte.hu/seminar.html