Related papers: Sparser variance for primes in arithmetic progress…

We establish a general large sieve inequality with sparse sets $\mathcal{S}$ of moduli in the Gaussian integers which are in a sense well-distributed in arithmetic progressions. This extends earlier work of S. Baier on the large sieve with…

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

A numerical study on the distributions of primes in short intervals of length $h$ over the natural numbers $N$ is presented. Based on Cram\'er's model in Number Theory, we obtain a heuristic expression applicable when $h \gg \log{N}$ but $h…

Let $\varepsilon>0$ be given. For prime power moduli $q=p^k$ with $k\geq 2$ and $p\neq 3$, and assuming the Ramanujan--Petersson conjecture for $\GL_2$ Maass forms, we prove that the Rankin--Selberg coefficients $\{\lambda_f(n)^2\}_{n\geq…

Our main result states that when A, B, C are subsets of Z/NZ of respective densities \alpha,\beta,\gamma, the sumset A + B + C contains an arithmetic progression of length at least e^{c(\log N)^c} for densities \alpha > (\log N)^{-2 +…

In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…

Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…

For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of distinct, nonzero roots of $f$ is bounded above by $2 (q-1)^{1-\varepsilon} C^\varepsilon$, where $\varepsilon = 1/(t-1)$ and $C$ is the…

Permutations of the positive integers avoiding arithmetic progressions of length $5$ were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length $7$. We…

We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…

It is known that there is a one-to-one correspondence between equivalence classes of primitive indefinite binary quadratic forms and primitive hyperbolic conjugacy classes of the modular group. Due to such a correspondence, Sarnak obtained…

Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

Let $j\geq 3$ be any fixed integer and $f$ be a primitive holomorphic cusp form of even integral weight $\kappa\geq 2$ for the full modular group $SL(2,\mathbb{Z})$. We write $\lambda_{{\rm{sym}^j }f}(n)$ for the $n^\text{th}$ normalized…

We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…

We prove an asymptotic formula for squarefree in arithmetic progressions with squarefree moduli, improving previous results by Prachar. The main tool is an estimate for counting solutions of a congruence inside a box that goes beyond what…

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form $\lambda^{s_n}$. In particular, we obtain a result which is…

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Given a density t in (0,1], and a prime p, let S be any subset of F_p having at least tp elements, and having the least number of three-term arithmetic progressions mod p among all subsets of F_p with at least tp elements. Define N(t,p) to…