Limiting-distribution equivalence for identical-letter pair counts
Statement
Let be the number of distinct adjacent pairs of identical letters in a geometrically distributed word of length , and let be the sum of independent random variables with Poisson distributions. Limiting-distribution conjecture. For any ,
This is stated as a weaker alternative to the higher-moment conjecture. It proposes that the distribution functions of the dependent statistic and its independent Poisson approximation become asymptotically indistinguishable.
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.