Related papers: Primes in arithmetic progressions and semidefinite…
We obtain an asymptotic formula for the number of primes $p\leq x_1$, $p\leq x_2$ such that $p_1(p_2+a)\equiv l \pmod q$ with $(a,q)=(l,q)=1$, $q\leq x^{\kappa_0}$, $x_1\geq x^{1-\alpha}$, $x_2\geq x^{\alpha}$, $$…
We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…
The variance of primes in short intervals relates to the Riemann Hypothesis, Montgomery's Pair Correlation Conjecture and the Hardy--Littlewood Conjecture. In regards to its asymptotics, very little is known unconditionally. We study the…
We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…
We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length $k$ in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes.
Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…
An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G. Robin on the upper and the lower bound…
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…
A deep conjecture of Montgomery and Soundararajan on the distribution of prime numbers in short intervals of length $h$ says that the third moment is bounded by $\ll h^{\frac {3}{2}-c}$ for some $c>0$. There is in the literature some…
Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.
We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…
In 2016, Dummit, Granville, and Kisilevsky showed that the proportion of semiprimes (products of two primes) not exceeding a given $x$, whose factors are congruent to $3$ modulo $4$, is more than a quarter when $x$ is sufficiently large.…
Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…
It is developed the theory of the Dirichlet problem for harmonic functions. On this basis, for the nondegenerate Beltrami equations in the quasidisks and, in particular, in the smooth domains, it is proved the existence of regular solutions…
We provide a primal-dual framework for randomized approximation algorithms utilizing semidefinite programming (SDP) relaxations. Our framework pairs a continuum of APX-complete problems including MaxCut, Max2Sat, MaxDicut, and more…
We study optimization programs given by a bilinear form over non-commutative variables subject to linear inequalities. Problems of this form include the entangled value of two-prover games, entanglement-assisted coding for classical…
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
Some mean value theorems in the style of Bombieri-Vinogradov's theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean…
We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…