ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Sm,n\mathfrak{S}_{m,n} be the set of multiset permutations under consideration, let π\pi be uniformly random in Sm,n\mathfrak{S}_{m,n}, and let Lm,n1(π)L^1_{m,n}(\pi) be the continuously increasing subsequence statistic. Define

μ=E[Lm,n1(π)].\mu=\mathbb{E}[L^1_{m,n}(\pi)].

For each r≥1r\ge 1, define

cr={r!2r/2(r/2)!r even,r!3⋅2(r−1)/2((r−3)/2)!r odd.c_r=\begin{cases}\dfrac{r!}{2^{r/2}(r/2)!}& r\text{ even},\\[4pt]\dfrac{r!}{3\cdot 2^{(r-1)/2}((r-3)/2)!}& r\text{ odd}. \end{cases}

Central moment conjecture. For all r≥1r\ge 1, if nn is sufficiently large in terms of mm, then

E[(Lm,n1(π)−μ)r]=crm⌊r/2⌋+O(m⌊r/2⌋−1).\mathbb{E}[(L^1_{m,n}(\pi)-\mu)^r]=c_r m^{\left\lfloor r/2\right\rfloor}+O\left(m^{\left\lfloor r/2\right\rfloor-1}\right).

The conjecture is based on computational evidence for higher moments. Together with the known asymptotic standard deviation σ∼m1/2\sigma\sim m^{1/2}, it would imply convergence of the standardized moments to the Gaussian moments, and hence convergence in distribution to a standard normal law.

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.