The asymptotic conjecture for the longest initial card-type subsequence
Statement
Let and be positive integers. For a random permutation of a multiset containing copies of each card type , let be the largest integer for which there exist indices with for every , and set . Asymptotic conjecture. If is sufficiently large in terms of , then
The conjecture predicts that the greedy strategy can recover almost all card types in order when the multiplicity is sufficiently large relative to . The paper proves the upper bound and gives the lower bound , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.