Proofs of five conjectures on matching coefficients of Baruah, Das and Schlosser by an algorithmic approach
Publication:2100055
DOI10.1016/J.JSC.2022.09.004zbMath1506.11132OpenAlexW4298006954WikidataQ114664461 ScholiaQ114664461MaRDI QIDQ2100055
Publication date: 21 November 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2022.09.004
modular formstheta functionsRogers-Ramanujan continued fractionvanishing coefficientsmatching coefficients
Partitions; congruences and congruential restrictions (11P83) Theta series; Weil representation; theta correspondences (11F27) Congruences for modular and (p)-adic modular forms (11F33)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithmic approach to Ramanujan-Kolberg identities
- An algorithmic approach to Ramanujan's congruences
- An algorithm to prove holonomic differential equations for modular forms
- On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm
- Finding modular functions for Ramanujan-type identities
- Matching coefficients in the series expansions of certain \(q\)-products and their reciprocals
This page was built for publication: Proofs of five conjectures on matching coefficients of Baruah, Das and Schlosser by an algorithmic approach