An algorithmic approach to Ramanujan-Kolberg identities
From MaRDI portal
Publication:480657
DOI10.1016/j.jsc.2014.09.018zbMath1356.11072OpenAlexW1970443390MaRDI QIDQ480657
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.09.018
Symbolic computation and algebraic computation (68W30) Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83) Number-theoretic algorithms; complexity (11Y16) Partition identities; identities of Rogers-Ramanujan type (11P84)
Related Items (29)
A family of congruences for Rogers-Ramanujan subpartitions ⋮ Dancing samba with Ramanujan partition congruences ⋮ A further look at cubic partitions ⋮ Congruences for k-elongated plane partition diamonds ⋮ Some missed congruences modulo powers of 2 for \(t\)-colored overpartitions ⋮ A single-variable proof of the omega SPT congruence family over powers of 5 ⋮ 4-regular partitions and the pod function ⋮ Parity of the coefficients of certain eta-quotients. II: The case of even-regular partitions ⋮ On the divisibility of 7-elongated plane partition diamonds by powers of 8 ⋮ Differences of even and odd numbers of parts of the cubic and analogous partition functions ⋮ MacMahon's partition analysis. XIV: Partitions with \(n\) copies of \(n\) ⋮ An elementary proof of a conjecture of Saikia on congruences for \(t\)-colored overpartitions ⋮ A CONJECTURE OF MERCA ON CONGRUENCES MODULO POWERS OF 2 FOR PARTITIONS INTO DISTINCT PARTS ⋮ On the density of the odd values of the partition function. II: An infinite conjectural framework ⋮ A method of verifying partition congruences by symbolic computation ⋮ On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm ⋮ Construction of modular function bases for Γ0(121) related to p(11n+6) ⋮ Broken 2-diamond partitions modulo 5 ⋮ Construction of all polynomial relations among Dedekind eta functions of level \(N\) ⋮ New congruences for broken $k$-diamond partitions ⋮ On the density of the odd values of the partition function and the \(t\)-multipartition function ⋮ On the density of the odd values of the partition function ⋮ Finding modular functions for Ramanujan-type identities ⋮ A proof of the Weierstraß gap theorem not using the Riemann-Roch formula ⋮ Some identities for the partition function ⋮ MacMahon's partition analysis XIII: Schmidt type partitions and modular forms ⋮ A congruence family for 2-elongated plane partitions: an application of the localization method ⋮ Computing an order-complete basis for \(M^{\infty}(N)\) and applications ⋮ Proofs of five conjectures on matching coefficients of Baruah, Das and Schlosser by an algorithmic approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Some congruences for Andrews-Paule's broken 2-diamond partitions
- An algorithmic approach to Ramanujan's congruences
- Some identities involving the partition function
- Construction and Application of a Class of Modular Functions†
- MacMahon's partition analysis XI: Broken diamonds and modular forms
- The Ramanujan Identities Under Modular Substitutions
- MacMahon's partition analysis: The Omega package
This page was built for publication: An algorithmic approach to Ramanujan-Kolberg identities
