Erdős–Hooley Delta-function: Overview

• The Erdős–Hooley Delta-function is defined as the maximum count of divisors in a sliding exponential window for an integer.
• It plays a crucial role in analytic number theory by measuring local divisor clumping and connecting classical divisor functions with refined local measures.
• Recent advances have sharpened the mean value and moment bounds using methods like Fourier analysis, combinatorial techniques, and probabilistic models.

The Erdős–Hooley Delta-function $\Delta(n)$ is a central object in the analytic study of local divisor concentrations of integers. For $n \geq 1$ and real $u$, define the local divisor count $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$, measuring the number of divisors of $n$ in the multiplicative window $(e^u, e^{u+1}]$. The Delta-function is the global maximum: $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$. This function quantifies the maximal "clumping" of divisors of $n$ on the log-scale and is situated, in terms of extremal behaviour, between the divisor function $\tau(n)$ and finer local measures of divisor spacing. Its moments, mean values, distributional limits, and variants twisted by characters on $\mathbb{Z}$ or ideals in number fields, are major topics in probabilistic and combinatorial number theory, with recent advances yielding nearly optimal bounds and conjectures relating to high-multiplicity subset sums.

1. Historical Context and Early Results

The study of $n \geq 1$0 originates from P. Erdős in the 1970s, seeking quantitative understanding of how divisors concentrate within short intervals on the exponential scale. Hooley proved in 1979 that the average order of $n \geq 1$1 is "substantially smaller than the ordinary divisor function" $n \geq 1$2: $n \geq 1$3, a saving over the classical mean value of $n \geq 1$4 (Koukoulopoulos et al., 2023). Subsequently, Hall and Tenenbaum obtained refined exponential and sub-exponential upper bounds—$n \geq 1$5 and similar estimates—together with early lower bounds of the form $n \geq 1$6 (Ford et al., 2023, Bretèche et al., 2022).

Maier and Tenenbaum showed that for almost all $n \geq 1$7, the normal order satisfies $n \geq 1$8 for any $n \geq 1$9, and Ford, Green, and Koukoulopoulos later established the nontrivial lower bound $u$0 for almost all $u$1, disproving a longstanding conjectured exponent (Ford et al., 2019, Bretèche et al., 2022).

2. Main Theorems: Mean Value and Moment Bounds

Recent advances have substantially tightened the obtainable exponents for both mean value and moments. Koukoulopoulos and Tao established that for all $u$2,

$u$3

(Koukoulopoulos et al., 2023), later improved via a refined moment-induction and Fourier smoothing to

$u$4

with a matching lower bound of $u$5 (Bretèche et al., 2023). Ford, Koukoulopoulos, and Tao pushed the lower bound further to

$u$6

for all $u$7 and any fixed $u$8, where $u$9 is the exponent from random set subsum multiplicity (Ford et al., 2023, Ford et al., 2019).

For higher moments, explicit upper bounds have been provided. If $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$0, $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$1, and $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$2 is a nonnegative multiplicative function satisfying mild conditions, then

$$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$3

if $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$4, with variants for lower $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$5 and specific results for the quadratic mean $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$6 (Bretèche et al., 5 Dec 2025). The true order for large $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$7 is $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$8.

3. Methods: Moments, Induction, and Fourier Analysis

A recurring methodology is the analysis of the $$\Delta(n, u) = |\{d : d \mid n,\ e^u < d \leqslant e^{u+1}\}|$$9-th moment

$n$0

where $n$1, and recursive inequalities for $n$2 under multiplicative extensions. A key identity is

$n$3

for $n$4, leading to recursive moment bounds via multilinear integrals and combinatorial arguments (Koukoulopoulos et al., 2023, Bretèche et al., 2023). Large-sieve and Parseval (Fourier) techniques are systematically applied to control concentrated divisor "spikes" and to extract probabilistic bounds for $n$5 over various domains.

The method of separating $n$6 into "smooth" and "rough" parts, combined with probabilistic models emulating the random distribution of prime factors (notably, the logarithmic random set model), underpins the derivation of the strongest lower bounds (Ford et al., 2023, Ford et al., 2019).

4. Distributional Laws, Normal Order, and Explicit Estimates

The normal order of $n$7 for typical $n$8 is now bracketed between substantial exponents: $n$9 for almost all $(e^u, e^{u+1}]$0 (Bretèche et al., 2022, Ford et al., 2019). Combinatorial optimization over subset sum multiplicities in random sets, with entropy constraints and probabilistic transference, is central to the lower bound of the normal order (Ford et al., 2019).

In short intervals, Bordelles has obtained fully explicit upper bounds for the sum $(e^u, e^{u+1}]$1, tracking all constants: $(e^u, e^{u+1}]$2 where $(e^u, e^{u+1}]$3 is an explicit function of $(e^u, e^{u+1}]$4 and $(e^u, e^{u+1}]$5 varies over $(e^u, e^{u+1}]$6 (Bordellès, 2024).

5. Generalizations: Twists, Characters, and Number Fields

The function extends to broader contexts: for a Dirichlet character $(e^u, e^{u+1}]$7 (real or complex), de la Bretèche and Tenenbaum, and later Lartaux (Lartaux, 2020), considered

$(e^u, e^{u+1}]$8

and established sharp dependence on the interval parameter $(e^u, e^{u+1}]$9 and moment exponents—e.g., $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$0, with $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$1 and $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$2 as defined in the paper (Lartaux, 2020). These results cover complex characters, answer a question of Hooley regarding statistics of local divisor sums in longer intervals, and show that the $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$3 dependence is generically $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$4 for the $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$5-th moment.

Higher degree generalizations appear for $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$6 and its moments, especially with character twists. For instance, Lartaux and de la Bretèche–Tenenbaum proved for nonprincipal characters $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$7 and all $\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$8,

$\Delta(n) = \max_{u \in \mathbb{R}} \Delta(n, u)$9

where $n$0 and $n$1 (Lartaux, 2021).

Extensions to arbitrary number fields $n$2 with ring of integers $n$3 consider

$n$4

and establish that $n$5 with $n$6 (Sofos, 2016).

6. Friable/Smooth Numbers and Phase Transitions

For friable (smooth) integers with $n$7, the mean value of $n$8 exhibits a phase transition depending on the friability parameter $n$9. For $\tau(n)$0 in suitable regimes, Martin–Tenenbaum–Wetzer proved:

• For moderately large $\tau(n)$1, $\tau(n)$2, and simultaneously $\tau(n)$3.
• For very small $\tau(n)$4, a precise asymptotic $\tau(n)$5 holds, with $\tau(n)$6 an explicit function (Martin et al., 2023).

Proofs rely on saddle-point/contour analysis for friable counts, combinatorial convolution with $\tau(n)$7, iterative $\tau(n)$8-mean methods, and exploitation of Gaussian-like behaviour of $\tau(n)$9 among friables.

7. Open Problems and Future Directions

Key remaining open questions include determining the sharp order of $\mathbb{Z}$0, narrowing the gap between the best-known lower ($\mathbb{Z}$1) and upper ($\mathbb{Z}$2) bounds, and closing the interval for the typical normal order exponent $\mathbb{Z}$3 between roughly $\mathbb{Z}$4 and $\mathbb{Z}$5 (Bretèche et al., 2023, Bretèche et al., 2022, Ford et al., 2023, Ford et al., 2019). Optimization in high-multiplicity subset sum problems—combinatorially controlling multiplicities of equal sums in random sets—remains tightly connected to analytic bounds for $\mathbb{Z}$6. Other major directions concern the second and higher moments over twists, asymptotics for distributions on polynomial values, refinement of explicit short interval bounds, and extension to higher-degree character and number field settings—significant for both foundational theory and applications such as Manin’s conjectures and Diophantine geometry (Sofos, 2016, Lartaux, 2020).

---

The recent literature provides a cohesive probabilistic and harmonic-analytic framework for the distribution and moments of the Erdős–Hooley Delta-function, connecting analytic number theory with combinatorial optimization and probabilistic models of divisor structures (Bretèche et al., 2022, Koukoulopoulos et al., 2023, Ford et al., 2023, Bretèche et al., 2023, Bretèche et al., 5 Dec 2025, Lartaux, 2020, Lartaux, 2021, Sofos, 2016, Bordellès, 2024, Martin et al., 2023, Ford et al., 2019).