arXiv · 1204.4738
A proof of Andrews' conjecture on Partitions with no short sequences
Abstract
Holroyd, Liggett, and Romik introduced the following probability model. Let $C_1, C_2,...$ be independent events with probabilities $¶_s(C_n)= 1-e^{-ns}$ under a probability measure $¶_s$ with $0<s<1$. Let $A_k$ be the event that there is no sequence of $k$ consecutive $C_i$ that do not occur. We given an asymptotic for $¶_s(A_k)$ with a relative error term that goes to 0 as $s\to 0$. This establishes a conjecture of Andrews.
Explore related subjects
Keep this discovery
Daniel M. Kane, Robert C. Rhoades. 2012-04-20. A proof of Andrews' conjecture on Partitions with no short sequences. https://arxiv.org/abs/1204.4738
Cite the original work for its findings. Save a collection to share your selection of sources.