An algorithm to prove holonomic differential equations for modular forms

DOI10.1007/978-3-030-84304-5_16zbMath1499.11179OpenAlexW3208258299MaRDI QIDQ2097084

Cristian-Silviu Radu, Paule, Peter

Publication date: 11 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84304-5_16

zbMATH Keywords

\(q\)-seriesmodular functionsmodular formspartition congruencesFricke-Klein relationsholonomic differential equationsholonomic functions and sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) (q)-calculus and related topics (05A30) Modular and automorphic functions (11F03)

Related Items (2)

Vanishing coefficients in quotients of theta functions with odd moduli ⋮ Proofs of five conjectures on matching coefficients of Baruah, Das and Schlosser by an algorithmic approach

Uses Software

• OEIS

Cites Work

• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• An algorithmic approach to Ramanujan's congruences
• A holonomic systems approach to special functions identities
• On differential equations satisfied by modular forms
• Ramanujan's Theta Functions
• Elliptic Modular Forms and Their Applications
• Holonomic relations for modular functions and forms: First guess, then prove
• Congruences involving binomial coefficients and Apery-like numbers
• Proof of a conjecture of Ramanujan
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm to prove holonomic differential equations for modular forms