ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let gd(n)g_d(n) denote the minimal number of peeling sequences of nn points in Rd\mathbb{R}^d. Here cc and epsilonepsilon 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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.