Related papers: Sums of Two Squares Visualized

We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^\theta$ for $\theta=1/2+1/2000.$ This improves the work of Matom\"aki (2009) who obtained the result for $\theta=1/2-\varepsilon$ (with…

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…

Many quantities of interest in communications, signal processing, artificial intelligence, and other areas can be expressed as the partition sum of some factor graph. Although the exact calculation of the partition sum is in many cases…

We give formulas for the number of representations of non negative integers by various quadratic forms. We also give evaluations in the case of sum of two cubes (cubic case) and the quintic case, as well. We introduce a class of generalized…

We prove that there are infinitely many integers, which can represent as sum of a square-free integer and a prime $p$ with $||\alpha p+\beta||<p^{-1/10}$, where $\alpha$ is irrational.

We consider the sum of squares function in the ring $\mathbb{Z}_{n}$. We determine formulae in a number of cases when $n$ is a power of a prime.

Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…

A curious identity of Bunyakovsky (1882), made more widely known by P\'olya and Szeg{\H o} in their ``Problems and Theorems in Analysis", gives an evaluation of a sum of the floor function of square roots involving primes $p\equiv…

We establish power saving asymptotics for the sum of the divisor function along a binary quartic form, improving on work of Daniel. The proof involves an application of a recent two dimensional delta method due to Li, Rydin-Myerson, and…

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

We study the moments of the function that counts the number of representations of an integer as sums of two prime squares. We refine some of the previous arguments and apply the Selberg sieve to get an unconditional upper bound for all…

We prove a summation formula for pairs of quadratic spaces following the conjectures of Braverman-Kazhdan, Lafforgue, Ng\^{o} and Sakellaridis. We also give an expression of the local factors where all the data are unramified.

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

The Macaulay2 package SumsOfSquares decomposes polynomials as sums of squares. It is based on methods to rationalize sum-of-squares decompositions due to Parrilo and Peyrl. The package features a data type for sums-of-squares polynomials,…

We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.

The Gram Spectrahedron of a polynomial parametrizes its sums-of-squares representations. In this note, we determine the dimension of Gram Spectrahedra of univariate polynomials.

Assuming the Riemann Hypothesis we prove that the interval $[N, N + H]$ contains an integer which is a sum of a prime and two squares of primes provided that $H \ge C (\log N)^{4}$, where $C > 0$ is an effective constant.

We prove the analogue of an identity of Huard, Ou, Spearman and Williams and apply it to evaluate a variety of sums involving divisor functions in two variables. It turns out that these sums count representations of positive integers…

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…