Sums of powers : an arithmetic refinement to the probabilistic model of Erdős and Rényi
نویسندگان
چکیده
Erdős and Rényi proposed in 1960 a probabilistic model for sums of s integral sth powers. Their model leads almost surely to a positive density for sums of s pseudo sth powers, which does not reflect the case of sums of two squares. We refine their model by adding arithmetical considerations and show that our model is in accordance with a zero density for sums of two pseudo-squares and a positive density for sums of s pseudo sth powers when s ≥ 3. Moreover, our approach supports a conjecture of Hooley on the average of the square of the number of representations.
منابع مشابه
Novel structures in Stanley sequences
Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley sequences. First, we characterize well-structured Stanley sequences as solutions to constraints in modular arithmetic, defining the modular Stanley sequences. Se...
متن کاملOn Connected Diagrams and Cumulants of Erdős-Rényi Matrix Models
Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian, we introduce two families of discrete matrix models constructed both with the help of the Erdős-Rényi ensemble of random graphs. Corresponding matrix sums represent the characteristic functions of the average number of q-step walks and q-step closed walks over the random graph. These sums can be considered as the d...
متن کاملFactors of sums of powers of binomial coefficients
We prove divisibility properties for sums of powers of binomial coefficients and of q-binomial coefficients. Dedicated to the memory of Paul Erdős
متن کاملChernoff type bounds for sum of dependent random variables and applications in additive number theory
We present generalizations of Chernoff’s large deviation bound for sum of dependent random variables. These generalizations seem to be very useful for the Erdős probabilistic method. As an illustrating application, we sketch the solution of an old problem of Nathanson [14] concerning thin Waring bases.
متن کاملFaulhaber’s Theorem for Arithmetic Progressions
Abstract. We show that the classical Faulhaber’s theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression a + b, a + 2b, . . . , a + nb is a polynomial in na+ n(n+ 1)b/2. The coefficients of these polynomials are given in terms of the Bernoulli polynomials. Following Knuth’s approach by using the central factorial...
متن کامل