arXiv subjects

Harald Andrés Helfgott

Publications and source records attributed to Harald Andrés Helfgott.

11 recordsLinked to original sources

arXiv2025

Optimal bounds for sums of non-negative arithmetic functions

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series admitting meromorphic continuation to the complex plane. Assume we know the location of the poles of $A(s)$ with $|\Im s| \leq T$, and their residues, for some large constant $T$. It is natural to ask how such finite spectral information may be best used to estimate partial sums $\sum_{n\leq x} a_n$. Here, we prove a sharp, general result on sums $\sum_{n\leq x} a_n n^{-σ}$ for $a_n$ non-negative, giving an optimal way to use information on the poles of $A(s)$ with $|\Im s|\leq T$, with no need for zero-free regions. We give not just bounds, but an explicit formula with compact support. Our bounds on $ψ(x)-x$ are, unsurprisingly, better and often simpler than a long list of existing explicit versions of the Prime Number Theorem. We treat the case of $M(x)$ and similar functions in a companion paper. Our solution mixes a Fourier-analytic approach in the style of Wiener--Ikehara with contour-shifting, using optimal approximants of Beurling--Selberg type found in (Graham--Vaaler, 1981).

math.NT↗

arXiv2025

Optimal bounds for sums of bounded arithmetic functions

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of $A(s)$ with $|\Im s| \leq T$ for some large constant $T$. What is the best way to use such finite spectral data to give explicit estimates on sums $\sum_{n\leq x} a_n$? The problem of giving explicit bounds on the Mertens function $M(x) = \sum_{n\leq x} μ(n)$ illustrates how open this basic question was. Bounding $M(x)$ might seem equivalent to estimating $ψ(x) = \sum_{n\leq x} Λ(n)$ or the number of primes $\leq x$. However, we have long had fairly good explicit bounds on prime counts, while bounding $M(x)$ remained a notoriously stubborn problem. We prove a sharp, general result on sums $\sum_{n\leq x} a_n n^{-σ}$ for $a_n$ bounded, giving an optimal way to use information on the poles of $A(s)$ with $|\Im s|\leq T$ and no data on the poles above. Our bounds on $M(x)$ are stronger than previous ones by many orders of magnitude. (Similar results for $ψ(x)$ are given in a companion paper.) Using rigorous residue computations by D. Platt, we obtain, for $x\geq 1$, $$|M(x)|\leq \frac{3}{π\cdot 10^{10}}\cdot x + 11.39 \sqrt{x}.$$ This is a corollary of our main result, essentially an explicit formula with the contribution of each pole clearly stated; we shall discuss how this finer structure can be useful. Our proof mixes a Fourier-analytic approach in the style of Wiener--Ikehara with contour-shifting, using optimal approximants of Beurling--Selberg type (Carneiro--Littmann, 2013); for $σ=1$, the approximant in (Vaaler, 1985) reappears. While we proceed independently of existing explicit work on $M(x)$ and $ψ(x)$, our method has an important step in common with work on another problem by (Ramana--Ramaré, 2020).

math.NT↗

arXiv2024

Growth estimates and diameter bounds for untwisted classical groups

Babai's conjecture states that, for any finite simple non-abelian group $G$, the diameter of $G$ is bounded by $(\log|G|)^{C}$ for some absolute constant $C$. We prove that, for any untwisted classical group $G$ of rank $r$ defined over a field $\mathbb{F}_{q}$ with $q$ not too small with respect to $r$, \begin{equation*} \mathrm{diam}(G(\mathbb{F}_{q}))\leq(\log|G(\mathbb{F}_{q})|)^{408r^{4}}. \end{equation*} This bound improves on results by Breuillard, Green, and Tao [9], Pyber and Szabó [38], and, for $q$ large enough, also by Halasi, Maróti, Pyber, and Qiao [16]. Our approach is in several ways closer to that of preexistent work by Helfgott [20], in that we give dimensional estimates (that is, bounds of the form $|A\cap V(\mathbb{F}_{q})|\ll|A^{C}|^{\dim(V)/\dim(G)}$, where $A$ is any generating set) for varieties $V$ of specific types, and work in the Lie algebra whenever possible. One of our main tools is a new, more efficient form of escape from subvarieties.

math.GR↗

arXiv2024

New dimensional estimates for subvarieties of linear algebraic groups

For every connected, almost simple linear algebraic group $G\leq\mathrm{GL}_{n}$ over a large enough field $K$, every subvariety $V\subseteq G$, and every finite generating set $A\subseteq G(K)$, we prove a general dimensional bound, that is, a bound of the form \[|A\cap V(\overline{K})|\leq C_{1}|A^{C_{2}}|^{\frac{\dim(V)}{\dim(G)}}\] with $C_{1},C_{2}$ depending only on $n,\mathrm{deg}(V)$. The dependence of $C_1$ on $n$ (or rather on $\dim (V)$) is doubly exponential, whereas $C_2$ (which is independent of $\mathrm{deg}(V)$) depends simply exponentially on $n$. Bounds of this form have proved useful in the study of growth in linear algebraic groups since 2005 (Helfgott) and, before then, in the study of subgroup structure (Larsen-Pink: $A$ a subgroup). In bounds for general $V$ and $G$ available before our work, the dependence of $C_1$ and $C_2$ on $n$ was of exponential-tower type. We draw immediate consequences regarding diameter bounds for untwisted classical groups $G(\mathbb{F}_{q})$. (In a separate paper, we derive stronger diameter bounds from stronger dimensional bounds we prove for specific families of varieties $V$.)

math.GR↗

arXiv2022

Aritmética, Grupos y Análisis (AGRA II, Cusco, Perú)

These are lecture notes for the AGRA II school, which took place in August 2015 at Universidad de San Antonio Abad del Cusco (Perú). They are geared towards graduate students and young researchers. I. Modular forms and Shimura curves (R. J. Miatello, G. Tornaría, A. Pacetti, M. Harris) II. Additive combinatorics (J. Rué, J. Wolf, J. Cilleruelo, P. Candela) III. Introduction to elliptic curves (M. Rebolledo and M. Hindry) IV. Growth in groups and expanders (H. A. Helfgott, M. Belolipetsky) V. Analysis and geometry in groups (A. Zuk) VI. Equidistribution and Diophantine analysis (R. Menares)

math.NT↗

arXiv2022

Optimality for the two-parameter quadratic sieve

We study the two-parameter quadratic sieve for a general test function. We prove, under some very general assumptions, that the function considered by Barban and Vehov [BV68] and Graham [Gra78] for this problem is optimal up to and including the second-order term. We determine that second-order term explicitly.

math.NT↗

arXiv2022

Expansion, divisibility and parity: an explanation

After seeing how questions on the finer distribution of prime factorization -- considered inaccessible until recently -- reduce to bounding the norm of an operator defined on a graph describing factorization, we will show how to bound that norm. In essence, the graph is a strong local expander, with all eigenvalues bounded by a constant factor times the theoretical minimum (i.e., the eigenvalue bound corresponding to Ramanujan graphs). The proof will take us on a walk from graph theory to linear algebra and the geometry of numbers, and back to graph theory, aided, along the way, by a generalized sieve. This is an expository paper; the full proof has appeared as a joint preprint with M. Radziwi\{l}\{l}.

math.NT↗

arXiv2021

Expansion, divisibility and parity

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + ε}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-ε}$. We show there exists a subset $\mathscr{X} \subset (N, 2N]$ of density close to $1$ such that all the eigenvalues of the linear operator $$(A_{|\mathscr{X}} f)(n) = \sum_{\substack{p \in \mathbf{P} : p | n \\ n, n \pm p \in \mathscr{X}}} f(n \pm p) \; - \sum_{\substack{p \in\mathbf{P} \\ n, n \pm p \in \mathscr{X}}} \frac{f(n \pm p)}{p}$$ are $O(\sqrt{\mathscr{L}})$. This bound is optimal up to a constant factor. In other words, we prove that a graph describing divisibility by primes is a strong local expander almost everywhere, and indeed within a constant factor of being "locally Ramanujan" (a.e.). Specializing to $f(n) = λ(n)$ with $λ(n)$ the Liouville function, and using an estimate by Matomäki, Radziwiłł and Tao on the average of $λ(n)$ in short intervals, we derive that \[\frac{1}{\log x} \sum_{n\leq x} \frac{λ(n) λ(n+1)}{n} = O\Big(\frac{1}{\sqrt{\log \log x}}\Big),\] improving on a result of Tao's. We also prove that $\sum_{N<n\leq 2 N} λ(n) λ(n+1)=o(N)$ at almost all scales with a similar error term, improving on a result by Tao and Teräväinen. (Tao and Tao-Teräväinen followed a different approach, based on entropy, not expansion; significantly, we can take a much larger value of $H$, and thus consider many more primes.) We can also prove sharper results with ease. For instance: let $S_{N,k}$ the set of all $N<n\leq 2N$ such that $Ω(n) = k$. Then, for any fixed value of $k$ with $k = \log \log N + O(\sqrt{\log \log N})$ (that is, any "popular" value of $k$) the average of $λ(n+1)$ over $S_{N,k}$ is $o(1)$ at almost all scales.

math.NT↗

arXiv2017

Isomorphismes de graphes en temps quasi-polynomial (d'après Babai et Luks, Weisfeiler-Leman...)

Soient donnés deux graphes $Γ_1$, $Γ_2$ à $n$ sommets. Sont-ils isomorphes? S'ils le sont, l'ensemble des isomorphismes de $Γ_1$ à $Γ_2$ peut être identifié avec une classe $H π$ du groupe symétrique sur $n$ éléments. Comment trouver $π$ et des générateurs de $H$? Le défi de donner un algorithme toujours efficace en réponse à ces questions est resté longtemps ouvert. Babai a récemment montré comment résoudre ces questions -- et d'autres qui y sont liées -- en temps quasi-polynomial, c'est-à-dire en temps $\exp(O(\log n)^{O(1)})$. Sa stratégie est basée en partie sur l'algorithme de Luks (1980/82), qui a résolu le cas de graphes de degré borné. English translation: Graph isomorphisms in quasipolynomial time [after Babai and Luks, Weisfeiler--Leman,...]. Let $Γ_1$, $Γ_2$ be two graphs with $n$ vertices. Are they isomorphic? If any isomorphisms from $Γ_1$ to $Γ_2$ exist, they form a coset $H π$ in the symmetric group on $n$ elements. How can we find a representative $π$ and a set of generators for $H$? Finding an algorithm that answers such questions efficiently (in all cases) is a challenge that has long remained open. Babai has recently shown how to solve these problems and related ones in quasipolynomial time, i.e., time $\exp(O(\log n)^{O(1)})$. His strategy is based in part on an algorithm due to Luks (1980/82), who solved the case of graphs of bounded degree.

math.GR↗

arXiv2017

Graph isomorphisms in quasi-polynomial time

Let us be given two graphs $Γ_1$, $Γ_2$ of $n$ vertices. Are they isomorphic? If they are, the set of isomorphisms from $Γ_1$ to $Γ_2$ can be identified with a coset $H\cdotπ$ inside the symmetric group on $n$ elements. How do we find $π$ and a set of generators of $H$? The challenge of giving an always efficient algorithm answering these questions remained open for a long time. Babai has recently shown how to solve these problems -- and others linked to them -- in quasi-polynomial time, i.e. in time $\exp\left(O(\log n)^{O(1)}\right)$. His strategy is based in part on the algorithm by Luks (1980/82), who solved the case of graphs of bounded degree.

math.GR↗

arXiv2014

The ternary Goldbach problem

The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in the twentieth century. In 2013 -- following a line of research pioneered and developed by Hardy, Littlewood and Vinogradov, among others -- the author proved the conjecture. In this, as in many other additive problems, what is at issue is really the proper usage of the limited information we possess on the distribution of prime numbers. The problem serves as a test and whetting-stone for techniques in analysis and number theory -- and also as an incentive to think about the relations between existing techniques with greater clarity. We will go over the main ideas of the proof. The basic approach is based on the circle method, the large sieve and exponential sums. For the purposes of this overview, we will not need to work with explicit constants; however, we will discuss what makes certain strategies and procedures not just effective, but efficient, in the sense of leading to good constants. Still, our focus will be on qualitative improvements.

math.NT↗