Related papers: Large sieve with sparse sets of moduli for $\mathb…

Let $ T_{P } f (x) = \int e ^{i P (y)} K (y) f (x-y) \; dy $, where $ K (y)$ is a smooth Calder\'on-Zygmund kernel on $ \mathbb R ^{n}$, and $ P$ be a polynomial. We show that there is a sparse bound for the bilinear form $ \langle T_P f, g…

The Li--Wan sieve is extended to multisets when the underlying set is symmetric. The main ingredient of the proof is the Mobius inversion formula on the poset of partitions of $\{1,2,\dots,k\}$ ordered by refinement. As illustrative…

Let $W$ be a smooth test function with compact support in $(0,\infty)$. Conditional on the Generalized Riemann Hypothesis for Hecke $L$-functions over $\mathbb{Q}(\omega)$, we prove that $$\sum_{p \equiv 1 \pmod{3}} \frac{1}{2 \sqrt{p}}…

We survey the recent applications and developments of sieve methods related to discrete groups, especially in the case of infinite index subgroups of arithmetic groups.

In this paper, we present an improvement of a large sieve type inequality in high dimensions and discuss its implications on a related problem.

In this paper, we generalized the Wijsman statistical convergence of closed sets in metric space by introducing the $f$-Wijsman statistical convergence these of sets, where $f$ is an unbounded modulus. It is shown that the Wijsman…

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

We prove, in respect of an arbitrary Hecke congruence subgroup \Gamma =\Gamma_0(q_0) of the group SL(2,Z[i]), some new upper bounds (or `spectral large sieve inequalities') for sums involving Fourier coefficients of \Gamma -automorphic cusp…

We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets of primes. We derive new results for the lower bound sieve suited especially for this setup and we apply them in particular to give a new…

We show that for every finite set of prime numbers S, there are at most finitely many singular moduli that are S-units. The key new ingredient is that for every prime number p, singular moduli are p-adically disperse. We prove analogous…

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…

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+\delta}$ which have conveniently sized divisors. The main feature of…

We provide here a modest improvement upon a large sieve inequality for quadratic polynomial amplitudes orginally due to Liangyi Zhao.

The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…

We study generalized Skewes' numbers, which are the locations of the first sign change between two comparable prime counting functions. In the context of the race between quadratic residues and quadratic nonresidues, we construct sequences…

We study a variant of the Hasse principle for finite Galois modules, allowing exceptional sets of positive density. For a Galois module whose underlying abelian group is isomorphic to $\mathbb{F}_p^{\oplus r}$ ($r \leq 2$), we show that the…

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

In sparse convolution-type problems, a common technique is to hash the input integers modulo a random prime $p\in [Q/2,Q]$ for some parameter $Q$, which reduces the range of the input integers while preserving their additive structure.…

We obtain an analog of the Montgomery-Hooley asymptotic formula for the variance of the number of primes in arithmetic progressions. In the present paper the moduli are restricted to the sequences of integer parts $[F(n)]$, where $F(t) =…