Elliptic function based algorithms to prove Jacobi theta function relations

DOI10.1016/J.JSC.2017.11.011zbMath1396.33043OpenAlexW2769498219MaRDI QIDQ1635281

Liangjie Ye

Publication date: 6 June 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2017.11.011

zbMATH Keywords

modular formscomputer algebraJacobi theta functionsalgorithmic zero-recognitionautomatic proving of special function identities

Mathematics Subject Classification ID

Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Uses Software

• DLMF

Cites Work

• A symbolic decision procedure for relations arising among Taylor coefficients of classical Jacobi theta functions
• Elliptic functions and applications
• Tata lectures on theta. I: Introduction and motivation: Theta functions in one variable. Basic results on theta functions in several variables. With the assistance of C. Musili, M. Nori, E. Previato, and M. Stillman
• On the equivalence of two fundamental theta identities
• Complex analysis. Transl. from the German by Dan Fulea
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Elliptic function based algorithms to prove Jacobi theta function relations