Exponential lower-bound conjecture for peeling sequences

Let gd(n)g_d(n) denote the minimal number of peeling sequences of nn points in Rd\mathbb{R}^d. Here cc and ϵ\epsilon are positive constants.

Peeling-sequence growth conjecture. The minimal number of peeling sequences of nn points in Rd\mathbb{R}^d is at least

c(d+1+ϵ)n,c(d+1+\epsilon)^n,

so that

gd(n)=Ω((d+1+ϵ)n).g_d(n)=\Omega((d+1+\epsilon)^n).

The conjecture proposes an improvement over the trivial lower bound for the minimal number of peeling sequences. Its motivation comes from the Fractional Erdős–Szekeres Theorem, while the source states that the lower bound remains open.

Sources & referencesView supporting material

Primary source

Dániel Gábor Simon, “Further analysis of Peeling Sequences”, arXiv:2510.03832 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.