Stanley's lemma and multiple theta functions

From MaRDI portal
Publication:4605441



Abstract: We present an algorithmic approach to the verification of identities on multiple theta functions in the form of products of theta functions [(−1)deltaa1alpha1a2alpha2cdotsaralpharqs;qt]infty, where alphai are integers, delta=0 or 1, sinmathbbQ, tinmathbbQ+, and the exponent vectors (alpha1,alpha2,ldots,alphar) are linearly independent over mathbbQ. For an identity on such multiple theta functions, we provide an algorithmic approach for computing a system of contiguous relations satisfied by all the involved multiple theta functions. Using Stanley's Lemma on the fundamental parallelepiped, we show that a multiple theta function can be determined by a finite number of its coefficients. Thus such an identity can be reduced to a finite number of simpler relations. Many classical multiple theta function identities fall into this framework, including Riemann's addition formula and the extended Riemann identity.




Cites work









This page was built for publication: Stanley's lemma and multiple theta functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605441)