Sums of Kloosterman Sums.
We find, via the Selberg-Delange method, an asymptotic formula for the mean of arithmetic functions on certain APs. It generalizes a result due to Cui and Wu (2014).
We show that if A and B are subsets of the primes with positive relative lower densities α and β, then the lower density of A+B in the natural numbers is at least , which is asymptotically best possible. This improves results of Ramaré and Ruzsa and of Chipeniuk and Hamel. As in the latter work, the problem is reduced to a similar problem for subsets of using techniques of Green and Green-Tao. Concerning this new problem we show that, for any square-free m and any of densities α and β, the...
Significant values of a combinatorial count need not fit the recurrence for the count. Consequently, initial values of the count can much outnumber those for the recurrence. So is the case of the count, Gl(n), of distance-l independent sets on the cycle Cn, studied by Comtet for l ≥ 0 and n ≥ 1 [sic]. We prove that values of Gl(n) are nth power sums of the characteristic roots of the corresponding recurrence unless 2 ≤ n ≤ l. Lucas numbers L(n) are thus generalized since L(n) is the count in question...
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...