Search arXiv⌕ Search

arXiv · 2610.17675

A sharp lower bound for the sextic large sieve

Abstract

We establish a matching lower bound for the sextic large sieve over the Eisenstein integers in an unbalanced range, with both indices restricted to squarefree ideals. Let $Ξ_6(A,B)$ denote the squared operator norm of the sextic residue-character matrix with row and column norms at most $A$ and $B$, respectively, outside a fixed finite set of primes containing those above $6$. For every fixed $0<δ<3/11$ and every $\varepsilon>0$, we prove $Ξ_6(A,B)\gg_{δ,\varepsilon}(AB)^{-\varepsilon}A^{5/6}B^{1/3}$ for $B^{16/11+δ}\le A\le B^{2-δ}$. Consequently, the full-cutoff norm satisfies $Ξ_6(X,X)\gg_\varepsilon X^{17/16-\varepsilon}$. The main difficulty is to preserve the large second moment supplied by Gauss sums when the column moduli are restricted to be squarefree. We prove a second-moment formula uniform in the prime exclusions and character twists arising from Möbius inversion, and use it to show that the squarefree projection retains a positive proportion of the original moment. A separate argument combining cubic and sextic large-sieve bounds then transfers the lower bound to squarefree rows.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuanda Xu, Hejian Sang. 2026-10-13. A sharp lower bound for the sextic large sieve. https://arxiv.org/abs/2610.17675

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗