Dedekind eta functions are know to satisfy certain difference equations/recurrence relations. The same is true for ratios of eta functions. Suppose some ratio of eta functions, say $A(q)$ satisfies the recurrence $$f(u, v) = (u - v^2)*(u^2 - v) + 2(u^2 + u*v + v^2)$$ by way of $f(A(q), b*A(q^2)) = 0$. In this case $A(q)$ is a polynomial where some of the terms are known.
As a particular example suppose some coefficients of the polynomial $A(q)$ are given by: $$A(q) = \frac{1}{q} + q - q^2 + q^3 + q^4 - q^7 + 2 \, q^8 + \cdots.$$ The question becomes: How can the Mathematica code be given such that the coefficients of a polynomial, $A(q)$, can be found that satisfies the recurrence $f(A(q), b*A(q^2)) = 0$ ?
In terms of a sample towards a working code:
f[u_, v_]:= (u - v^2)*(u^2 - v) + 2(u^2 + u*v + v^2);
0:= f[A[q], A[q^2]];
CoefficientList[Series[A[q], {q,0,30}], q]
what is missed, for me, is how to define the polynomial A[q_] to start the process.
b
a constant? Does the expression forA[q]
show all its terms of orderq^8
or lower - or might there be unknown terms likec q^5
? $\endgroup$