English
Related papers

Related papers: On the friable mean-value of the Erd\H{o}s-Hooley …

200 papers

For integer $n\geqslant 1$ and real $u$, let $\Delta(n,u):=|\{d:d\mid n,\,{\rm e}^u<d\leqslant {\rm e}^{u+1}\}|$. The Erd\H{o}s--Hooley Delta-function is then defined by $\Delta(n):=\max_{u\in{\mathbb R}}\Delta(n,u).$ We improve a recent…

Number Theory · Mathematics 2025-02-14 Régis de la Bretèche , Gérald Tenenbaum

For integer $n\geqslant 1$ and real $u$, let $\Delta(n,u):=|\{d:d\mid n,\,{\rm e}^u<d\leqslant {\rm e}^{u+1}\}|$. The Erd\H{o}s--Hooley Delta-function is then defined by $\Delta(n):=\max_{u\in{\mathbb R}}\Delta(n,u).$ We improve the current…

Number Theory · Mathematics 2022-10-26 Régis de la Bretèche , Gérald Tenenbaum

For integer $n\geqslant 1$ and real $u$, let $\Delta(n,u):=|\{d:d\mid n,\,{\rm e}^u<d\leqslant {\rm e}^{u+1}\}|$. The Erd\H{o}s--Hooley Delta-function is then defined by $\Delta(n):=\max_{u\in{\mathbb R}}\Delta(n,u).$ We provide new upper…

Number Theory · Mathematics 2025-12-08 R. de la Bretèche , G. Tenenbaum

The Erd\H{o}s-Hooley Delta function is defined for $n\in\mathbb{N}$ as $\Delta(n)=\sup_{u\in\mathbb{R}} \#\{d|n : e^u<d\le e^{u+1}\}$. We prove that $\sum_{n\le x} \Delta(n) \ll x(\log\log x)^{11/4}$ for all $x\ge100$. This improves on…

Number Theory · Mathematics 2023-12-11 Dimitris Koukoulopoulos , Terence Tao

We give an improved lower bound for the average of the Erd\H{o}s-Hooley function $\Delta(n)$, namely $\sum_{n\le x} \Delta(n) \gg_\varepsilon x(\log\log x)^{1+\eta-\varepsilon}$ for all $x\geqslant100$ and any fixed $\varepsilon$, where…

Number Theory · Mathematics 2024-05-24 Kevin Ford , Dimitris Koukoulopoulos , Terence Tao

Let $(f_1,f_2)$ a $2$-tuple of arithmetic functions and $$\Delta_3(n,f_1,f_2):=\sup\limits_{\substack{(u_1,u_2) \in \mathbb{R}^{2} \\(v_1,v_2) \in [0,1]^{2}}}\Big\lvert \sum\limits_{\substack{d_1 d_{2} \mid n \\ e^{u_i}<d_i\leqslant…

Number Theory · Mathematics 2021-05-07 Alexandre Lartaux

We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erd\H os-Hooley $\Delta$-function, we derive lower bounds for the…

Number Theory · Mathematics 2026-01-14 Régis de la Bretèche , Gérald Tenenbaum

We study the extent to which divisors of a typical integer $n$ are concentrated. In particular, defining the Erd\H{o}s-Hooley $\Delta$-function by $\Delta(n) := \max_t \# \{d | n, \log d \in [t,t+1]\}$, we show that $\Delta(n) \geq (\log…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Ben Green , Dimitris Koukoulopoulos

Let $d_{\alpha, \beta}(n)=\sum\limits_{\substack{n=kl \alpha l<k\leq\beta l}}1$ be the number of ways of factoring n into two almost equal integers. For rational numbers $0<\alpha <\beta $, we consider the following Zeta function…

Number Theory · Mathematics 2013-01-01 Kui Liu

According to a general probabilistic principle, the natural divisors of friable integers (i.e.~free of large prime factors) should normally present a Gaussian distribution. We show that this indeed is the case with conditional density…

Number Theory · Mathematics 2018-05-29 Sary Drappeau , Gérald Tenenbaum

Let $k\geq 1$ be an integer. Let $\delta_k(n)$ denote the maximum divisor of $n$ which is co-prime to $k$. We study the error term of the general $m$-th Riesz mean of the arithmetical function $\delta_k(n)$ for any positive integer $m \ge…

Number Theory · Mathematics 2018-02-14 Saurabh Kumar Singh

Let $\phi(n)$ be the Euler totient function and $\sigma(n)$ denote the sum of divisors of $n$. In this note, we obtain explicit upper bounds on the number of positive integers $n\leq x$ such that $\phi(\sigma(n)) > cn$ for any $c>0$. This…

Number Theory · Mathematics 2024-08-06 Saunak Bhattacharjee , Anup B. Dixit

An integer is said to be $y$-friable if its greatest prime factor P(n) is less than $y$. In this paper, we study numbers of the shape $n-1$ when $P(n)\leq y$ and $n\leq x$. One expects that, statistically, their multiplicative behaviour…

Number Theory · Mathematics 2015-04-22 Sary Drappeau

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Number Theory · Mathematics 2016-11-16 Aleksandar Ivić

Suppose $k\geqslant3$ is an integer. Let $\tau_k(n)$ be the number of ways $n$ can be written as a product of $k$ fixed factors. For any fixed integer $r\geqslant2$, we have the asymptotic formula \begin{equation*}…

Number Theory · Mathematics 2024-11-12 Zhen Guo , Xin Li

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.

Number Theory · Mathematics 2018-12-27 Jean-Marie De Koninck , Patrick Letendre

We derive an upper bound for the mean of the supremum of the empirical process indexed by a class of functions that are known to have variance bounded by a small constant $\delta$. The bound is expressed in the uniform entropy integral of…

Statistics Theory · Mathematics 2010-12-30 Aad van der Vaart , Jon A. Wellner

In this paper, we define a notion of $\beta$-dimensional mean oscillation of functions $u: Q_0 \subset \mathbb{R}^d \to \mathbb{R}$ which are integrable on $\beta$-dimensional subsets of the cube $Q_0$: \begin{align*}…

Analysis of PDEs · Mathematics 2022-09-13 You-Wei Benson Chen , Daniel Spector

A number is said to be $y$-friable if it has no prime factor greater than $y$. In this paper, we prove a central limit theorem on average for the distribution of divisors of $y$-friable numbers less than $x$, for all $(x, y)$ satisfying…

Number Theory · Mathematics 2016-12-14 Sary Drappeau

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich
‹ Prev 1 2 3 10 Next ›