Two vectors in $\BZ^3$ are called \emph{twins} if they are orthogonal and have the same length. The paper describes twin pairs using cubic lattices, and counts the number of twin pairs with a given length. Integers $M$ with the property that each integral vector with length $\sqrt{M}$ has a twin are called twin-complete. They are completely characterized modulo a famous conjecture in number theory. The main tool is the decomposition theory of Hurwitz integral quaternions. Throughout the paper we made a concerted effort to keep the exposition as elementary as possible.
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of the coefficients of some infinite products.
We use Bourgain's recent bound for short exponential sums to prove certain independence results related to the distribution of squarefree numbers in arithmetic progressions.
The representation of integral binary forms as sums of two squares is discussed and applied to establish the Manin conjecture for certain Châtelet surfaces defined over the rationals.
Congruences of truncated sums of infinite series do not directly extend to congruences of the truncated sums of higher powers of these infinite series. Guo and Zudilin recently established a variety of supercongruences for truncated sums of certain basic hypergeometric series. In this note we extend some of these supercongruences to the truncated sums of the squares of the corresponding series.
In this paper, we investigate sums of four squares of integers whose prime factorizations are restricted, making progress towards a conjecture of Sun that states that two of the integers may be restricted to the forms $2^a3^b$ and $2^c5^d$. We obtain an ineffective generalization of results of Gauss and Legendre on sums of three squares and an effective generalization of Lagrange's four-square theorem.
We use the spectral theory of Hilbert-Maass forms for real quadratic fields to obtain the asymptotics of some sums involving the number of representations as a sum of two squares in the ring of integers.
We use a representability theorem of G. L. Watson to examine sums of squares in Quaternion rings with integer coefficients. This allows us to determine a large family of such rings where every element expressible as the sum of squares can be written as the sum of 3 squares.
For suitable pairs of diagonal quadratic forms in 8 variables we use the circle method to investigate the density of simultaneous integer solutions and relate this to the problem of estimating linear correlations among sums of two squares.
We show that there are short intervals $[x,x+y]$ containing $\gg y^{1/10}$ numbers expressible as the sum of two squares, which is many more than the average when $y=o( (\log{x})^{5/9})$. We obtain similar results for sums of two squares in short arithmetic progressions.
In this paper, we prove a conjecture of Chan and Chua for the number of representations of integers as sums of 8s integral squares. The proof uses a theorem of Imamoglu and Kohnen, and the double shuffle relations satisfied by the double Eisenstein series of level 2.
In this paper we study quadratic forms which are universal when restricted to almost prime inputs, establishing finiteness theorems akin to the Conway--Schneeberger 15 theorem.
In this paper, we prove some results of restricted sums of four squares using arithmetic of quaternions in the ring of Lipschitz integers. For example, we show that every nonnegative integer $n$ can be written as $x^{2}+y^{2}+z^{2}+t^{2}$ where $x,y,z,t$ are integers and $x+y+2z+2t$ is a square or a cube.
Lagrange's Four Squares Theorem states that any positive integer can be expressed as the sum of four integer squares. We investigate the analogous question over Quaternion rings, focusing on squares of elements of Quaternion rings with integer coefficients. We determine the minimum necessary number of squares for infinitely many Quaternion rings, and give global upper and lower bounds.
In a surprising recent work, Lemke Oliver and Soundararajan noticed how experimental data exhibits erratic distributions for consecutive pairs of primes in arithmetic progressions, and proposed a heuristic model based on the Hardy--Littlewood conjectures containing a large secondary term, which fits the data very well. In this paper, we study consecutive pairs of sums of squares in arithmetic progressions, and develop a similar heuristic model based on the Hardy--Littlewood conjecture for sums of squares, which also explain the biases in the experimental data. In the process, we prove several …
Sums of squares of $|ζ(1/2+it)|$ over short intervals are investigated. Known upper bounds for the fourth and twelfth moment of $|ζ(1/2+it)|$ are derived. A discussion concerning other possibilities for the estimation of higher power moments of $|ζ(1/2+it)|$ is given.
We construct a binary linear code $C(O(3,q))$, associated with the orthogonal group $O(3,q)$. Here $q$ is a power of two. Then we obtain a recursive formula for the odd power moments of Kloosterman sums with trace one arguments in terms of the frequencies of weights in the codes $C(O(3,q))$ and $C(Sp(2,q))$. This is done via Pless power moment identity and by utilizing the explicit expressions of Gauss sums for the orthogonal groups.
Let $\mathbf H_2$ denote the set of even integers $n \not\equiv 1 \pmod 3$. We prove that when $H \ge X^{0.33}$, almost all integers $n \in \mathbf H_2$, $X < n \le X + H$ can be represented as the sum of a prime and the square of a prime. We also prove a similar result for sums of three squares of primes.
For any integer $x$, let $T_x$ denote the triangular number $\frac{x(x+1)}{2}$. In this paper we give a complete characterization of all the triples of positive integers $(α, β, γ)$ for which the ternary sums $αx^2 +βT_y + γT_z$ represent all but finitely many positive integers. This resolves a conjecture of Kane and Sun \cite[Conjecture 1.19(i)]{KS08} and complete the characterization of all almost universal ternary mixed sums of squares and triangular numbers.
In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious oversight in our first paper, but make further progress on the exponential sums estimates needed, together with an embellishment of the previous sieve technique employed. This leads to an improvement in our bounds for the maximal size of the exceptional sets.
In this note, we characterize all functions $f : \mathbb{N} \rightarrow \mathbb{C}$ such that $f(x_1^2+ \cdots + x_k^2)=f(x_1)^2+ \cdots + f(x_k)^2$, where $k \geq 3$ and $x_1, \cdots, x_k$ are positive integers.
We estimate the mean square of a short exponential sum involving Fourier coefficients of a cusp form with a linear twist, a smooth weight function, and a relatively short averaging interval.
Let $r_3(n)$ be the number of representations of a positive integer $n$ as a sum of three squares of integers. We give two distinct proofs of a conjecture of Wagon concerning the asymptotic value of the mean square of $r_3(n)$.
We study real quadratic fields $\mathbb{Q}(\sqrt{D})$ such that, for a given rational integer $m$, all $m$-multiples of totally positive integers are sums of squares. We prove quite sharp necessary and sufficient conditions for this to happen. Further, we give a fast algorithm that solves this question for specific $m$, $D$ and we give complete results for $m \leq 5000$.
In this paper, we construct two ternary linear codes associated with the symplectic groups Sp(2,q) and Sp(4,q). Here q is a power of three. Then we obtain recursive formulas for the power moments of Kloosterman sums with square arguments and for the even power moments of those in terms of the frequencies of weights in the codes. This is done via Pless power moment identity and by utilizing the explicit expressions of "Gauss sums" for the symplectic groups Sp(2n,q).
Suppose a positive integer $n$ is written as a sum of squares of $m$ integers. What can one say about the value $T$ of the sum of these $m$ integers itself? Which $T$ can be obtained if one considers all possible representations of $n$ as a sum of squares of $m$ integers? Denoting this set of all possible $T$ by $\mathscr{S}_m(n)$, Goldmakher and Pollack have given a simple characterization of $\mathscr{S}_4(n)$ using elementary arguments. Their result can be reinterpreted in terms of Mordell's theory of representations of binary integral quadratic forms as sums of squares of integral linear f…
We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
In this paper, we evaluate a smoothed sum of the form $\displaystyle \sideset{}{^*}\sum_{d \leq X}\left(\sum_{n \leq Y} \left(\frac{8d}{n} \right ) \right)^2$, where $\left ( \frac{8d}{\cdot} \right )$ is the Kronecker symbol and $\sideset{}{^*}\sum$ denotes a sum over positive odd square-free integers.
We find an asymptotic formula for the number of primitive vectors $(z_1,\ldots,z_4)\in (\mathbb{Z}_{\neq 0})^4$ such that $z_1,\ldots, z_4$ are all squareful and bounded by $B$, and $z_1+\cdots + z_4 = 0$. Our result agrees in the power of $B$ and $\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and Várilly-Alvarado.
In this paper, we improve the moment estimates for the gaps between numbers that can be represented as a sum of two squares of integers. We consider certain sum of Bessel functions and prove the upper bound for its weighted mean value. This bound provides estimates for the $γ$-th moments of gaps for all $γ\leq 2$.
Let $E(N)$ denote the number of positive integers $n \le N$, with $n \equiv 4 \pmod{24}$, which cannot be represented as the sum of four squares of primes. We establish that $E(N)\ll N^{11/32}$, thus improving on an earlier result of Harman and the first author, where the exponent $7/20$ appears in place of $11/32$.
In 2016, while studying restricted sums of integral squares, Sun posed the following conjecture: Every positive integer $n$ can be written as $x^2+y^2+z^2+w^2$ $(x,y,z,w\in\mathbb{N}=\{0,1,\cdots\})$ with $x+3y$ a square. Meanwhile, he also conjectured that for each positive integer $n$ there exist integers $x,y,z,w$ such that $n=x^2+y^2+z^2+w^2$ and $x+3y\in\{4^k:k\in\mathbb{N}\}$. In this paper, we confirm these conjectures via some arithmetic theory of ternary quadratic forms.
We prove that the greatest positive integer that is not expressible as a linear combination with integer coefficients of elements of the set $\{n^2,(n+1)^2,\ldots \}$ is asymptotically $O(n^2)$, verifying thus a conjecture of Dutch and Rickett. Furthermore we ask a question on the representation of integers as sum of four large squares.
We show that a certain two-dimensional family of Weyl sums of length $P$ takes values as large as $P^{3/4 + o(1)}$ on almost all linear slices of the unit torus, contradicting a widely held expectation that Weyl sums should exhibit square-root cancellation on generic subvarieties of the unit torus. This is an extension of a result of J. Brandes, S. T. Parsell, C. Poulias, G. Shakan and R. C. Vaughan (2020) from quadratic and cubic monomials to general polynomials of arbitrary degree. The new ingredients of our approach are the classical results of E. Bombieri (1966) on exponential sums along a…
The present paper proves that if for a power sum $α$ over $\ZZ$ the length of the period of the continued fraction for $\sqrt{α(n)}$ is constant for infinitely many even (resp. odd) $n$, then $\sqrt{α(n)}$ admits a functional continued fraction expansion for all even (resp. odd) $n$, except finitely many; in particular, for such $n$, the partial quotients can be expressed by power sums of the same kind.
A natural number $n$ is $y$-smooth if the greatest prime factor of $n$ does not exceed $y$. Let $s_{1}$ and $s_{2}$ are $y$-smooth numbers. We consider sums of smooth squares of the binary Titchmarsh divisor problem and give asymptotic formulae for $\sum_{s_{1}^{2}+s_{2}^{2}\le x}τ(s_{1}^{2}+s_{2}^{2}+1)$ for $(\log x)^{K}\le y<x^{\frac{1}{2}}$, where $K$ is large enough.
