Cooper–Hirschhorn type identities for three or more squares. III

Abstract Let dollar sign rs left parenthesis n right parenthesis dollar sign $r_s(n)$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:msub> <mml:mi>r</mml:mi> <mml:mi>s</mml:mi> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> denote the number of representations of dollar sign n dollar sign $n$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> as a sum of dollar sign s dollar sign $s$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>s</mml:mi> </mml:mrow> </mml:math> squares. Hurwitz established eleven identities expressing the generating function of dollar sign r 3 left parenthesis an plus b right parenthesis dollar sign $r_3(an+b)$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:msub> <mml:mi>r</mml:mi> <mml:mn>3</mml:mn> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>a</mml:mi> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mi>b</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> as a simple infinite product. Cooper and Hirschhorn (Discrete Math 274 (1-3):9–24, 2004) proved that for any dollar sign k greater than or equals 0 dollar sign $k\geq0$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> , the generating functions dollar sign sigma summation n equals 0 infinity r 3 left parenthesis 32 kn right parenthesis qn dollar sign $\sum_{n=0}^\infty r_3\big(3^{2k}n\big)q^n$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:msubsup> <mml:mo>∑</mml:mo> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:mo>∞</mml:mo> </mml:msubsup> <mml:msub> <mml:mi>r</mml:mi> <mml:mn>3</mml:mn> </mml:msub> <mml:mo maxsize="1.2em" minsize="1.2em">(</mml:mo> <mml:msup> <mml:mn>3</mml:mn> <mml:mrow> <mml:mn>2</mml:mn> <mml:mi>k</mml:mi> </mml:mrow> </mml:msup> <mml:mi>n</mml:mi> <mml:mo maxsize="1.2em" minsize="1.2em">)</mml:mo> <mml:msup> <mml:mi>q</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> </mml:math> and dollar sign sigma summation n equals 0 infinity r 3 left parenthesis 32 k plus 1 n right parenthesis qn dollar sign

Authors

Institutions

Publication Details

Journal
Proceedings of the Edinburgh Mathematical Society
Published
2026-05-22
DOI
https://doi.org/10.1017/s0013091526101448
Primary Topic
Analytic Number Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cooper–Hirschhorn type identities for three or more squares. III

Dazhao Tang
Proceedings of the Edinburgh Mathematical Society
Analytic Number Theory Research
article

Cooper–Hirschhorn type identities for three or more squares. III

Dazhao Tang
article en

Abstract

Abstract Let dollar sign rs left parenthesis n right parenthesis dollar sign $r_s(n)$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:msub> <mml:mi>r</mml:mi> <mml:mi>s</mml:mi> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> denote the number of representations of dollar sign n dollar sign $n$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> as a sum of dollar sign s dollar sign $s$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>s</mml:mi> </mml:mrow> </mml:math> squares. Hurwitz established eleven identities expressing the generating function of dollar sign r 3 left parenthesis an plus b right parenthesis dollar sign $r_3(an+b)$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:msub> <mml:mi>r</mml:mi> <mml:mn>3</mml:mn> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>a</mml:mi> <mml:mi>n</mml:mi> <mml:mo>+</mml:mo> <mml:mi>b</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> as a simple infinite product. Cooper and Hirschhorn (Discrete Math 274 (1-3):9–24, 2004) proved that for any dollar sign k greater than or equals 0 dollar sign $k\geq0$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> , the generating functions dollar sign sigma summation n equals 0 infinity r 3 left parenthesis 32 kn right parenthesis qn dollar sign $\sum_{n=0}^\infty r_3\big(3^{2k}n\big)q^n$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:msubsup> <mml:mo>∑</mml:mo> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:mo>∞</mml:mo> </mml:msubsup> <mml:msub> <mml:mi>r</mml:mi> <mml:mn>3</mml:mn> </mml:msub> <mml:mo maxsize="1.2em" minsize="1.2em">(</mml:mo> <mml:msup> <mml:mn>3</mml:mn> <mml:mrow> <mml:mn>2</mml:mn> <mml:mi>k</mml:mi> </mml:mrow> </mml:msup> <mml:mi>n</mml:mi> <mml:mo maxsize="1.2em" minsize="1.2em">)</mml:mo> <mml:msup> <mml:mi>q</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> </mml:math> and dollar sign sigma summation n equals 0 infinity r 3 left parenthesis 32 k plus 1 n right parenthesis qn dollar sign

Proceedings of the Edinburgh Mathematical Society
Chongqing Normal University (CN)
Openalex Percentile: Top 3%
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.