Explicit bounds for sums of squares

DOI10.4310/MRL.2012.V19.N2.A8MaRDI QIDQ2391607zbMATH OpenFDO

Authors Jeremy Rouse

Publication date 5 August 2013

Published in Mathematical Research Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1105.4824

Mathematics Subject Classification ID

Fourier coefficients of automorphic forms (11F30) Sums of squares and representations by other particular quadratic forms (11E25)

Abstract: For an even integer $k$, let $r_{2k}(n)$ be the number of representations of $n$ as a sum of $2k$ squares. The quantity $r_{2k}(n)$ is appoximated by the classical singular series $h{o}_{2k}(n)asymp{n}^{k-1}$. Deligne's bound on the Fourier coefficients of Hecke eigenforms gives that $r_{2k}(n)=h{o}_{2k}(n)+O(d(n)n^{frack-12})$. We determine the optimal implied constant in this estimate provided that either $k/2$ or $n$ is odd. The proof requires a delicate positivity argument involving Petersson inner products.

Recommendations

• Correlated sums of \(r(n)\)
• On sums of \(k\)-th powers: A mean-square bound over short intervals
• On sums of two kth powers: an asymptotic formula for the mean square of the error term
• Representations of integers as sums of 32 squares
• scientific article; zbMATH DE number 472856

Cited in

(4)

• The number of representations of \(n\) as a growing number of squares
• Coefficient bounds for level 2 cusp forms
• On the number of even values of an eta-quotient
• On the remainder term in the approximate Fourier inversion formula for distribution functions

This page was built for publication: Explicit bounds for sums of squares

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