To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Let $r_s(n)$ denote the number of representations of $n$ as a sum of $s$ squares. Hurwitz established eleven identities expressing the generating function of $r_3(an+b)$ as a simple infinite product. Cooper and Hirschhorn (Discrete Math 274 (1-3):9–24, 2004) proved that for any $k\geq0$, the generating functions $\sum_{n=0}^\infty r_3\big(3^{2k}n\big)q^n$ and $\sum_{n=0}^\infty r_3\big(3^{2k+1}n\big)q^n$ can be written as linear combinations of two specified generalized eta-quotients. In this paper, we substantially extend these results to high dimensions. Specifically, we prove that for any $k\geq0$ and $3\leq s\leq 100$, the generating functions $\sum_{n=0}^\infty r_s\big(3^{2k+1}n\big)q^n$ and $\sum_{n=0}^\infty r_s\big(3^{2k+2}n\big)q^n$ can also be expressed as linear combinations of certain generalized eta-quotients. Motivated by these results, we conjecture that this phenomenon holds for $r_s(n)$ for all $s\geq3$, and further that $r_s(n)$ satisfies an infinite family of internal congruences modulo high powers of $3$.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.