Related papers: Large sieve inequalities with power moduli and War…

In this paper, we extend the large sieve type estimates to sums involving pth powers of trigonometric polynomials. An approach to such estimates that does not rely on the usual L^2-technique is given. Our method is based on comparing the…

By developing the method of Wooley on the quadratic Waring-Goldbach problem, we prove that all sufficiently large even integers can be expressed as a sum of four squares of primes and 46 powers of 2.

Let $k \geq 2$ and $b \geq 3$ be integers, and suppose that $d_1, d_2 \in \{0,1,\dots, b - 1\}$ are distinct and coprime. Let $\mathcal{S}$ be the set of non-negative integers, all of whose digits in base $b$ are either $d_1$ or $d_2$. Then…

We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordell\`{e}s (2007),…

The Hardy-Littlewood majorant problem has a positive answer only for expo- nents p which are even integers, while there are counterexamples for all p =2 2N. Montgomery conjectured that there exist counterexamples even among idempotent…

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove…

We establish two new Waring--Goldbach type representations: every sufficiently large odd integer $n$ can be expressed as \[ n = p_1^2 + p_2^2 + p_3^3 + p_4^3 + p_5^5 + p_6^6 + p_7^c, \] where each $p_i$ is prime and $c \in \{6,7\}$.

We prove a lower bound for the large sieve with square moduli.

We modify the approach to the arithmetical form of the large sieve by relying on the Parseval identity rather than on an approximate Bessel inequality and as a consequence, improve on the weighted large sieve inequality beyond what was…

We investigate sums of mixed powers involving two squares and three biquadrates. In particular, subject to the truth of the Generalised Riemann Hypothesis and the Elliott-Halberstam Conjecture, we show that all large natural numbers n with…

We discuss properties of certain generalization of Power Means proposed in 1971 by Carlson, Meany and Nelson. For any fixed parameter (k,s,q) and vector (v_1,...,v_n) they take the q-th power means of all possible k-tuples…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information…

We establish that, for almost all natural numbers $N$, there is a sum of two positive integral cubes lying in the interval $[N-N^{7/18+\epsilon},N]$. Here, the exponent $7/18$ lies half way between the trivial exponent $4/9$ stemming from…

We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$,…

In this paper we study the equation $$ x^k + (x+1)^k = y^n,\quad n\geq 3, $$ when $k\equiv 2\pmod{4}$. We prove that the only solutions are for $x=0, -1$ when $6\leq k\leq 100$ or for a $k$ with odd prime factors congruent to $3\pmod{4}$.…

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

We use sums of Liouville type to count the number of ways a positive integer can be represented by the forms $(a+c)^{1/3}x + (b+d)y$, $(a+c)x + \bigl(k(b+d) \bigr)^{1/3} y$, and $\bigl(k(a+c) \bigr)^{1/3} x + l(b+d) y$ for nonnegative…

We study the average size of shifted convolution summation terms related to the problem of Quantum Unique Ergodicity on ${\rm SL}_2 (\mathbbm{Z})\backslash \mathbbm{H}$. Establishing an upper-bound sieve method for handling such sums, we…