arXiv subjects

Jacques Benatar

Publications and source records attributed to Jacques Benatar.

9 recordsLinked to original sources

arXiv2024

A short-interval Hildebrand-Tenenbaum theorem

In the late eighties, Hildebrand and Tenenbaum proved an asymptotic formula for the number of positive integers below $x$, having exactly $\nu$ distinct prime divisors: $\pi_{\nu}(x) \sim x \delta_{\nu}(x)$. Here we consider the restricted count $\pi_{\nu}(x,y)$ for integers lying in the short interval $(x,x+y]$. In this setting, we show that for any $\varepsilon >0$, the asymptotic equivalence \[ \pi_{\nu}(x,y) \sim y \delta_{\nu}(x)\] holds uniformly over all $1 \le \nu \le (\log x)^{1/3}/(\log \log x)^2$ and all $x^{17/30 + \varepsilon} \leq y \leq x$. The methods also furnish mean upper bounds for the $k$-fold divisor function $\tau_k$ in short intervals, with strong uniformity in $k$.

math.NT↗

arXiv2022

Extremal bounds for Dirichlet polynomials with random multiplicative coefficients

For $X(n)$ a Steinhaus random multiplicative function, we study the maximal size of the random Dirichlet polynomial $$ D_N(t) = \frac1{\sqrt{N}} \sum_{n \leq N} X(n) n^{it}, $$ with $t$ in various ranges. In particular, for fixed $C>0$ and any small $\varepsilon>0$ we show that, with high probability, $$ \exp( (\log N)^{1/2-\varepsilon} ) \ll \sup_{|t| \leq N^C} |D_N(t)| \ll \exp( (\log N)^{1/2+\varepsilon}). $$

math.NT↗

arXiv2021

Zero distribution of power series and binary correlation of coefficients

We study the distribution of zeroes of power series with infinite radius of convergence. The coefficients of the series have the form $\xi(n)a(n)$, where $a$ is a smooth sequence of positive numbers, and $\xi$ is a sequence of complex-valued multipliers having binary correlations and no gaps in the spectrum. We show that under certain assumptions on the smoothness of the sequence $a$ and on the binary correlations of the multipliers $\xi$, the zeroes of the power series are equidistributed with respect to a radial measure defined by the sequence $a$. We apply our approach to several examples of the sequence $\xi$: (i) IID sequences, (ii) sequences $e(\alpha n^2)$ with Diophantine $\alpha$, (iii) random multiplicative sequences, (iv) the Golay--Rudin--Shapiro sequence, (v) the indicator function of the square-free integers, (vi) the Thue--Morse sequence.

math.CV↗

arXiv2020

Moments of polynomials with random multiplicative coefficients

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1 \big| P_N(\theta) \big|^{2k}\, d\theta $$ tend to Gaussian moments in the sense of mean-square convergence, uniformly for $k \ll (\log N / \log \log N)^{1/3}$, but that in contrast to the case of i.i.d. coefficients, this behavior does not persist for $k$ much larger. We use these estimates to (i) give a proof of an almost sure Salem-Zygmund type central limit theorem for $P_N(\theta)$, previously obtained in unpublished work of Harper by different methods, and (ii) show that asymptotically almost surely $$ (\log N)^{1/6 - \varepsilon} \ll \max_\theta |P_N(\theta)| \ll \exp((\log N)^{1/2+\varepsilon}), $$ for all $\varepsilon > 0$.

math.NT↗

arXiv2019

The "pits effect" for entire functions of exponential type and the Wiener spectrum

Given a sequence $\xi\colon \mathbb Z_+ \to \mathbb C$, we find a simple spectral condition which guarantees the angular equidistribution of the zeroes of the Taylor series \[ F_\xi (z) = \sum_{n\ge 0} \xi (n) \frac{z^n}{n!}\,. \] This condition yields practically all known instances of random and pseudo-random sequences $\xi$ with this property (due to Nassif, Littlewood, Chen-Littlewood, Levin, Eremenko-Ostrovskii, Kabluchko-Zaporozhets, Borichev-Nishry-Sodin), and provides several new ones. Among them are Besicovitch almost periodic sequences and multiplicative random sequences. It also conditionally yields that the M\"obius function $\mu$ has this property assuming "the binary Chowla conjecture".

math.PR↗

arXiv2017

Planck-scale distribution of nodal length of arithmetic random waves

We study the nodal length of random toral Laplace eigenfunctions ("arithmetic random waves") restricted to decreasing domains ("shrinking balls"), all the way down to Planck scale. We find that, up to a natural scaling, for "generic" energies the variance of the restricted nodal length obeys the same asymptotic law as the total nodal length, and these are asymptotically fully correlated. This, among other things, allows for a statistical reconstruction of the full toral length based on partial information. One of the key novel ingredients of our work, borrowing from number theory, is the use of bounds for the so-called spectral Quasi-Correlations, i.e. unusually small sums of lattice points lying on the same circle.

math-ph↗

arXiv2017

Random waves on $\mathbb{T}^3$: nodal area variance and lattice point correlations

We consider the ensemble of random Gaussian Laplace eigenfunctions on $\mathbb{T}^3=\mathbb{R}^3/\mathbb{Z}^3$ (`$3d$ arithmetic random waves'), and study the distribution of their nodal surface area. The expected area is proportional to the square root of the eigenvalue, or `energy', of the eigenfunction. We show that the nodal area variance obeys an asymptotic law. The resulting asymptotic formula is closely related to the angular distribution and correlations of lattice points lying on spheres.

math.NT↗

arXiv2015

Goldbach versus de Polignac numbers

In this note we use recent developments in sieve theory to highlight the interplay between Goldbach and de Polignac numbers. Assuming that the primes have level of distribution greater than $1/2$, we show that at least one of two nice properties holds. Either consecutive Goldbach numbers lie within a finite distance from one another or else the set of de Polignac numbers has full density in $2 \mathbb{N}$. Using very similar techniques we give a conditional proof that the set of limit points of the sequence of normalised prime gaps $(p_{n+1}-p_n)/ \log p_n$ has density at least $2/3$ in the positive reals.

math.NT↗

arXiv2014

The existence of small prime gaps in subsets of the integers

We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic progressions. Letting $q_n$ denote the $n$-th prime in $\mathcal{C}$, we will establish that for any small constant $ε>0$, the set $\left\{q_n| q_{n+1}-q_n \leq ε\log n \right\}$ constitutes a positive proportion of all prime numbers. Using the techniques developed by Maynard and Tao we will also demonstrate that $\mathcal{C}$ has bounded prime gaps. Specific examples, such as the case where $\mathcal{C}$ is an arithmetic progression have already been studied and so the purpose of this paper is to present results for general classes of sets.

math.NT↗