A method of verifying partition congruences by symbolic computation
From MaRDI portal
Publication:2229703
DOI10.1016/j.jsc.2020.04.008zbMath1462.11092arXiv2004.02193OpenAlexW3018830140MaRDI QIDQ2229703
Nicolas Allen Smoot, Cristian-Silviu Radu
Publication date: 18 February 2021
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.02193
Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Andrews-Sellers family of partition congruences
- An algorithmic approach to Ramanujan-Kolberg identities
- Overpartitions into distinct parts without short sequences
- Computational proofs of congruences for \(2\)-colored Frobenius partitions
- A family of congruences for Rogers-Ramanujan subpartitions
- A proof of the Weierstraß gap theorem not using the Riemann-Roch formula
- Hecke operators on \(\Gamma_0(m)\)
- Proof of a conjecture of Ramanujan
- Construction and Application of a Class of Modular Functions (II)†
- Ramanujans Vermutung über Zerfällungszahlen.