A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES

DOI10.1017/fms.2019.8zbMath1414.05034arXiv1204.4738OpenAlexW2964207809WikidataQ122884557 ScholiaQ122884557MaRDI QIDQ5378494

Robert C. Rhoades, Daniel M. Kane

Publication date: 31 May 2019

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4738

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial probability (60C05) Analytic theory of partitions (11P82)

Related Items (2)

Integer partitions, probabilities and quantum modular forms ⋮ Distinct parts partitions without sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Andrews-Zagier asymptotics for partitions without sequences
• Integrals, partitions and MacMahon's theorem
• Slow convergence in bootstrap percolation
• Successions in integer partitions
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Distinct parts partitions without sequences
• A Tauberian theorem for partitions
• Improved bounds on metastability thresholds and probabilities for generalized bootstrap percolation
• K-RUN OVERPARTITIONS AND MOCK THETA FUNCTIONS
• An extension of the Hardy-Ramanujan circle method and applications to partitions without sequences
• Metastability effects in bootstrap percolation
• The Structure of Random Partitions of Large Integers
• Integrals, partitions, and cellular automata
• Convolution Bootstrap Percolation Models, Markov-type Stochastic Processes, and Mock Theta Functions
• Partitions with short sequences and mock theta functions
• Some new partition theorems
• An algebraic identity of F. H. Jackson and its implications for partitions

This page was built for publication: A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES