An algorithm to prove algebraic relations involving eta quotients

DOI10.1007/s00026-018-0388-yzbMath1429.11083OpenAlexW2802492269MaRDI QIDQ1653317

Cristian-Silviu Radu

Publication date: 3 August 2018

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-018-0388-y

zbMATH Keywords

modular functionssymbolic computationDedekind eta function

Mathematics Subject Classification ID

Modular and automorphic functions (11F03) Dedekind eta function, Dedekind sums (11F20) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Related Items (5)

A family of congruences for Rogers-Ramanujan subpartitions ⋮ MacMahon's partition analysis. XIV: Partitions with \(n\) copies of \(n\) ⋮ Construction of all polynomial relations among Dedekind eta functions of level \(N\) ⋮ A proof of the Weierstraß gap theorem not using the Riemann-Roch formula ⋮ Computing an order-complete basis for \(M^{\infty}(N)\) and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Partition analysis, modular functions, and computer algebra
• Construction and Application of a Class of Modular Functions (II)†
• Multiplicative 𝜂-quotients

This page was built for publication: An algorithm to prove algebraic relations involving eta quotients