ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mm and nn be positive integers. For a random permutation π\boldsymbol{\pi} of a multiset containing nn copies of each card type 1,…,m1,\ldots,m, let L(π)L(\pi) be the largest integer pp for which there exist indices i1<⋯<ipi_1<\cdots<i_p with πij=j\pi_{i_j}=j for every 1≤j≤p1\le j\le p, and set Lm,n=E[L(π)]\mathcal{L}_{m,n}=\mathbb{E}[L(\boldsymbol{\pi})]. Asymptotic conjecture. If nn is sufficiently large in terms of mm, then

Lm,n=m−o(m).\mathcal{L}_{m,n}=m-o(m).

The conjecture predicts that the greedy strategy can recover almost all card types in order when the multiplicity nn is sufficiently large relative to mm. The paper proves the upper bound Lm,n≤m+O(m3/4log⁡m)\mathcal{L}_{m,n}\le m+O(m^{3/4}\log m) and gives the lower bound Lm,n=Ω(m/log⁡m)\mathcal{L}_{m,n}=\Omega(m/\log m), leaving the asymptotic behavior unresolved.

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.