HHHarald Andrés Helfgott

Harald Andrés Helfgott

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Harald Andrés Helfgott has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimal bounds for sums of non-negative arithmetic functions

    by Andrés Chirre, Harald Andrés Helfgott

    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).

    • 19 November 2025
    • Published by HAL in HAL
    Open Access

    Optimal bounds for sums of bounded arithmetic functions

    by Harald Helfgott, Andrés Chirre

    Published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

  • Open Access

    Optimal bounds for sums of bounded arithmetic functions

    by Andrés Chirre, Harald Andrés Helfgott

    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).

  • New Dimensional Estimates for Subvarieties of Linear Algebraic Groups

    by Jitendra Bajpai, Daniele Dona, Harald Andrés Helfgott


  • Open Access

    New dimensional estimates for subvarieties of linear algebraic groups

    by Jitendra Bajpai, Daniele Dona, Harald Andrés Helfgott

    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$.)

  • Open Access

    Summing $\mu (n)$: a faster elementary algorithm

    by Harald Andrés Helfgott, Lola Thompson

    We present a new elementary algorithm that takes $$ \textrm{time} \ \ O_\epsilon \left( x^{\frac{3}{5}} (\log x)^{\frac{8}{5}+\epsilon } \right) \ \ \textrm{and} \ \textrm{space} \ \ O\left( x^{\frac{3}{10}} (\log x)^{\frac{13}{10}} \right) $$ time O ϵ x 3 5 ( log x ) 8 5 + ϵ and space O x 3 10 ( log x ) 13 10 (measured bitwise) for computing $$M(x) = \sum _{n \le x} \mu (n),$$ M ( x ) = ∑ n ≤ x μ ( n ) , where $$\mu (n)$$ μ ( n ) is the Möbius function. This is the first improvement in the exponent of x for an elementary algorithm since 1985. We also show that it is possible to reduce space consumption to $$O(x^{1/5} (\log x)^{5/3})$$ O ( x 1 / 5 ( log x ) 5 / 3 ) by the use of (Helfgott in: Math Comput 89:333–350, 2020), at the cost of letting time rise to the order of $$x^{3/5} (\log x)^2 \log \log x$$ x 3 / 5 ( log x ) 2 log log x .


  • Open Access

    Summing $μ(n)$: a faster elementary algorithm

    by Harald A. Helfgott, Lola Thompson

    We present a new elementary algorithm that takes \[ \mathrm{time} \ \ O_\epsilon\left(x^{\frac{3}{5}} (\log x)^{\frac{3}{5}+\epsilon} \right) \ \ \mathrm{and}\ \ \mathrm{space} \ \ O\left(x^{\frac{3}{10}} (\log x)^{\frac{13}{10}} \right)\] for computing $M(x) = \sum_{n \leq x} \mu(n),$ where $\mu(n)$ is the M\"{o}bius function. This is the first improvement in the exponent of $x$ for an elementary algorithm since 1985. We also show that it is possible to reduce space consumption to $O(x^{1/5} (\log x)^{5/3})$ by the use of (Helfgott, 2020; arxiv.org:1712.09130), at the cost of letting time rise to the order of $x^{3/5} (\log x)$.

  • Open Access

    Optimality for the two-parameter quadratic sieve

    by Emanuel Carneiro, Andrés Chirre, Harald Andrés Helfgott, Julian Mejia-Cordero

    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.

  • Open Access

    Expansion, divisibility and parity: an explanation

    by Harald Andrés Helfgott

    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}.