In this paper, we develop a large sieve type inequality with characters to square moduli. One expects that the result should be weaker than the classical inequality, but, conjecturally at least, not by much. The method is generalizable to higher power moduli.
We establish large sieve inequalities for power moduli in imaginary quadratic number fields, extending earlier work of Baier and Bansal for the Gaussian field.
We prove a lower and an upper bound for the large sieve with square moduli for function fields. These bounds correspond to bounds for the classical large sieve with square moduli established in arXiv:1812.05844 by Baier, Lynch and Zhao and arXiv:math/0512271 by Baier and Zhao. Our lower bound in the function field setting contradicts an upper bound obtained in arXiv:1802.03131 by Baier and Singh. Indeed, we point out an error in arXiv:1802.03131.
We prove large sieve inequalities with multivariate polynomial moduli and deduce a general Bombieri--Vinogradov type theorem for a class of polynomial moduli having a sufficient number of variables compared to its degree. This sharpens previous results of the first author in two aspects: the range of the moduli as well as the class of polynomials which can be handled. As a consequence, we deduce that there exist infinitely many primes $p$such that $p-1$ has a prime divisor of size $\gg p^{2/5+o(1)}$ that is the value of an incomplete norm form polynomial.
We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-ε}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and Iwaniec, who handled moduli of size at most $x^{4/7-ε}$. This has consequences for the level of distribution for sieve weights coming from the linear sieve.
We consider the large sieve inequality for sparse sequences of moduli and give a general result depending on the additive energy (both symmetric and asymmetric) of the sequence of moduli. For example, in the case of monomials $f(X) = X^k$ this allows us to improve, in some ranges of the parameters, the previous bounds of S. Baier and L. Zhao (2005), K.~Halupczok (2012, 2015, 2018) and M.~Munsch (2020). We also consider moduli defined by polynomials $f(X) \in \mathbb{Z}[X]$, Piatetski-Shapiro sequences and general convex sequences. We then apply our results to obtain a version of the Bombieri--…
Let $\mathfrak{F}_n$ be the set of all cuspidal automorphic representations $π$ of $\mathrm{GL}_n$ over a number field with unitary central character. We prove two unconditional large sieve inequalities for the Hecke eigenvalues of $π\in\mathfrak{F}_n$, one on the integers and one on the primes. The second leads to the first unconditional zero density estimate for the family of $L$-functions $L(s,π)$ associated to $π\in\mathfrak{F}_n$, which we make log-free. As an application of the zero density estimate, we prove a hybrid subconvexity bound for $L(\frac{1}{2},π)$ for a density one subset of …
In this paper we give a full description of the inequalities that can occur between overpartition ranks. If $ \overline{N}(a,c,n) $ denotes the number of overpartitions of $ n $ with rank congruent to $ a $ modulo $ c,$ we prove that for any $ c\ge7 $ and $ 0\le a<b\le\left\lfloor\frac{c}{2}\right\rfloor $ we have $ \overline{N}(a,c,n)>\overline{N}(b,c,n) $ for $n$ large enough. That the sign of the rank differences $ \overline{N}(a,c,n)-\overline{N}(b,c,n) $ depends on the residue class of $ n $ modulo $ c $ in the case of small moduli, such as $ c=6, $ is known due to the work of Ji, Zhang a…
ADA University(阿塞拜疆科技大学);Northwestern University(西北大学);Universidad Autónoma de Santo Domingo(圣多明各自治大学);University of British Columbia(不列颠哥伦比亚大学);Lake Forest College(湖森林学院)
We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^θ$ for $θ=1/2+1/2000.$ This improves the work of Matomäki (2009) who obtained the result for $θ=1/2-\varepsilon$ (with the added constraint that $d$ is also a prime), which improved the result of Baier and Zhao (2006) with $θ=4/9-\varepsilon.$ Similarly as in the work of Matomäki, we apply Harman's sieve method to detect primes $p \equiv 1 \, (d^2)$. To break the $θ=1/2$ barrier we prove a new bilinear equidistribution estimate modulo smooth square moduli $d^2$ by using a similar argument as …
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 primes $l\le x$ distribute as expected in arithmetic progressions mod $q$, except for a subset of $\mathcal{S}$ whose cardinality is bounded by a power of $\log x$. We use a $p$-adic variant Harman's sieve to extend Baker's range to $q\le x^{1/4-\varepsilon}$ if $\mathcal{S}$ is restricted to prime powers $p^N$, where $p\le (\log x)^C$ for some fixed but arb…