An algorithm to prove algebraic relations involving eta quotients
type: Item
instance of: scholarly article
title: An algorithm to prove algebraic relations involving eta quotients
zbMATH Open document ID: 1429.11083
author: Cristian-Silviu Radu
published in: Annals of Combinatorics
publication date: 2018-08-03T00:00:00Z
Mathematics Subject Classification ID: 11F20
Mathematics Subject Classification ID: 11F03
Mathematics Subject Classification ID: 33F10
zbMATH DE Number: 6913634
zbMATH Keywords: modular functions
zbMATH Keywords: Dedekind eta function
zbMATH Keywords: symbolic computation
MaRDI profile type: Publication
full work available at URL: s00026-018-0388-y
OpenAlex ID: W2802492269
cites work: Q4083553
cites work: Multiplicative 𝜂-quotients
cites work: Q4697470
cites work: Construction and Application of a Class of Modular Functions (II)†
cites work: Partition analysis, modular functions, and computer algebra
DOI: 10.1007/S00026-018-0388-Y
Recommended article: Algorithmic proof of the epsilon constant conjecture
Recommended article: Q3689404
Recommended article: Q5203268
Recommended article: Q4591305
Recommended article: A new elementary algorithm for proving \(q\)-hypergeometric identities
Recommended article: A finite soluble quotient algorithm
Recommended article: Towards a soluble quotient algorithm
Recommended article: Jacobian quotients, an algebraic proof
Recommended article: An algebraic method for computing \(N^\epsilon(f)\)
Recommended article: Algorithms for the Quillen-Suslin theorem
description: scientific article; zbMATH DE number 6913634