A proof of Andrews' conjecture on partitions with no short sequences
From MaRDI portal
Publication:5378494
Abstract: Holroyd, Liggett, and Romik introduced the following probability model. Let be independent events with probabilities under a probability measure with . Let be the event that there is no sequence of consecutive that do not occur. We given an asymptotic for with a relative error term that goes to 0 as . This establishes a conjecture of Andrews.
Recommendations
Cites work
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 5718024 (Why is no real title available?)
- A Tauberian theorem for partitions
- An algebraic identity of F. H. Jackson and its implications for partitions
- An extension of the Hardy-Ramanujan circle method and applications to partitions without sequences
- Convolution bootstrap percolation models, Markov-type stochastic processes, and mock theta functions
- Distinct parts partitions without sequences
- Improved bounds on metastability thresholds and probabilities for generalized bootstrap percolation
- Integrals, partitions and MacMahon's theorem
- Integrals, partitions, and cellular automata
- Metastability effects in bootstrap percolation
- Mock theta functions
- On the Andrews-Zagier asymptotics for partitions without sequences
- Partitions with short sequences and mock theta functions
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Slow convergence in bootstrap percolation
- Some new partition theorems
- Successions in integer partitions
- The Structure of Random Partitions of Large Integers
- Unearthing the visions of a master: harmonic Maass forms and number theory
- \(k\)-run overpartitions and mock theta functions
Cited in
(5)
This page was built for publication: A proof of Andrews' conjecture on partitions with no short sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378494)