A short and simple proof of Ramanujan's 11 partition congruence
From MaRDI portal
Publication:2017210
DOI10.1016/J.JNT.2013.12.014zbMATH Open1291.11128OpenAlexW2166145568MaRDI QIDQ2017210FDOQ2017210
Authors: Michael D. Hirschhorn 
Publication date: 25 June 2014
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2013.12.014
Elementary theory of partitions (11P81) Partition identities; identities of Rogers-Ramanujan type (11P84)
Cites Work
- Dyson’s crank of a partition
- Some Properties of Partitions
- New Combinatorial Interpretations of Ramanujan's Partition Congruences Mod 5,7 and 11
- Ramanujan's lost notebook. Part III
- Cranks and t-cores
- An elementary proof of p(11m+6)≡0 (mod 11)
- Sieved Partition Functions and q-Binomial Coefficients
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inequalities for the crank
- Another elementary proof that \(p(11n+6)\equiv 0\pmod{11}\)
- A Birthday Present for Ramanujan
- Ramanujan's partition congruences
Cited In (6)
- On 3-regular tripartitions
- Ramanujan-style proof of \(p_{-3}(11n+7) \equiv 0 \pmod{11}\)
- An invitation to formal power series
- Computer-assisted proofs of congruences for multipartitions and divisor function convolutions, based on methods of differential algebra
- Fractional powers of the generating function for the partition function
- Another elementary proof that \(p(11n+6)\equiv 0\pmod{11}\)
This page was built for publication: A short and simple proof of Ramanujan's \(\mod 11\) partition congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017210)
