SearcharxivSearch

arXiv subjects

Erwan Hillion

Publications and source records attributed to Erwan Hillion.

13 recordsLinked to original sources

Polynomial Moments with a weighted Zeta Square measure on the critical line

We prove closed-form identities for the sequence of moments $\int t^{2n}|Γ(s)ζ(s)|^2dt$ on the whole critical line $s=1/2+it$. They are finite sums involving binomial coefficients, Bernoulli numbers, Stirling numbers and $π$, especially featuring the numbers $ζ(n)B_n/n$ unveiled by Bettin and Conrey. Their main power series identity, together with our previous work, allows for a short proof of an auxiliary result: the computation of the $k$-th derivatives at $1$ of the "exponential auto-correlation" function studied in \cite{DH21a}. We also provide an elementary and self-contained proof of this secondary result. The starting point of our work is a remarkable identity proven by Ramanujan in 1915. %today interpreted as a Mellin-Plancherel isometry involving the $Γ$ and $ζ$ functions. The sequence of moments studied here, not to be confused with the moments of the Riemann zeta function, entirely characterizes $|ζ|$ on the critical line. They arise in some generalizations of the Nyman-Beurling criterion, but might be of independent interest for %various other applications, as well as for the numerous connections concerning the above mentioned numbers.

math.NT

Covariance inequalities for convex and log-concave functions

Extending results of Harg{é} and Hu for the Gaussian measure, we prove inequalities for the covariance Cov$_μ(f, g)$ where $μ$ is a general product probability measure on $\mathbb{R}^d$ and $f,g: \mathbb{R}^d \to \mathbb{R}$ satisfy some convexity or log-concavity assumptions, with possibly some symmetries.

math.PR

Polynomial approximations in a generalized Nyman-Beurling criterion

The Nyman-Beurling criterion, equivalent to the Riemann hypothesis (RH), is an approximation problem in the space of square integrable functions on $(0,\infty)$, involving dilations of the fractional part function by factors $θ_k\in(0,1)$, $k\ge1$. Randomizing the $θ_k$ generates new structures and criteria. One of them is a sufficient condition for RH that splits into (i) showing that the indicator function can be approximated by convolution with the fractional part, (ii) a control on the coefficients of the approximation. This self-contained paper generalizes conditions (i) and (ii) that involve a $σ_0\in(1/2,1)$, and imply $ζ(σ+it)\neq 0$ in the strip $1/2<σ\leσ_0<1$. We then identify functions for which (i) holds unconditionally, by means of polynomial approximations. This yields in passing a short probabilistic proof of a known consequence of Wiener's Tauberian theorem. In this context, the difficulty for proving RH is then reallocated in (ii), which heavily relies on the corresponding Gram matrices, for which two remarkable structures are obtained. We show that a particular tuning of the approximating sequence leads to a striking simplification of the second Gram matrix, then reading as a block Hankel form.

math.FA

On probabilistic generalizations of the Nyman-Beurling criterion for the zeta function

The Nyman-Beurling criterion is an approximation problem in the space of square integrable functions on $(0,\infty)$, which is equivalent to the Riemann hypothesis. This involves dilations of the fractional part function by factors $θ_k\in(0,1)$, $k\ge1$. We develop probabilistic extensions of the Nyman-Beurling criterion by considering these $θ_k$ as random: this yields new structures and criteria, one of them having a significant overlap with the general strong Báez-Duarte criterion. We start here the study of these criteria, with a special focus on exponential and gamma distributions. The main goal of the present paper is the study of the interplay between these probabilistic Nyman-Beurling criteria and the Riemann hypothesis. We are able to obtain equivalences in two main classes of examples: dilated structures as exponential $\cal E(k)$ distributions, and random variables $Z_{k,n}$, $1\le k\le n$, concentrated around $1/k$ as $n$ is growing. By means of our probabilistic point of view, we bring an answer to a question raised by Báez-Duarte in 2005: the price to pay to consider non compactly supported kernels is a controlled condition on the coefficients of the involved approximations.

math.NT

An exponentially averaged Vasyunin formula

We prove a Vasyunin-type formula for an autocorrelation function arising from a Nyman-Beurling criterion generalized to a probabilistic framework. This formula can also be seen as a reciprocity formula for cotangent sums, related to the ones proven in [BC13], [ABB17].

math.NT

A proof of the Shepp-Olkin entropy monotonicity conjecture

Consider tossing a collection of coins, each fair or biased towards heads, and take the distribution of the total number of heads that result. It is natural to conjecture that this distribution should be 'more random' when each coin is fairer. Indeed, Shepp and Olkin conjectured that the Shannon entropy of this distribution is monotonically increasing in this case. We resolve this conjecture, by proving that this intuition is correct. Our proof uses a construction which was previously developed by the authors to prove a related conjecture of Shepp and Olkin concerning concavity of entropy. We discuss whether this result can be generalized to $q$-Rényi and $q$-Tsallis entropies, for a range of values of $q$.

math.PR

An extremal property of the normal distribution, with a discrete analog

We prove, using the Brascamp-Lieb inequality, that the Gaussian measure is the only strong log-concave measure having a strong log-concavity parameter equal to its covariance matrix. We also give a similar characterization of the Poisson measure in the discrete case, using "Chebyshev's other inequality". We briefly discuss how these results relate to Stein and Stein-Chen methods for Gaussian and Poisson approximation, and to the Bakry-Emery calculus.

math.PR

Discrete versions of the transport equation and the Shepp-Olkin conjecture

We introduce a framework to consider transport problems for integer-valued random variables. We introduce weighting coefficients which allow us to characterize transport problems in a gradient flow setting, and form the basis of our introduction of a discrete version of the Benamou-Brenier formula. Further, we use these coefficients to state a new form of weighted log-concavity. These results are applied to prove the monotone case of the Shepp-Olkin entropy concavity conjecture.

math.PR

A proof of the Shepp-Olkin entropy concavity conjecture

We prove the Shepp--Olkin conjecture, which states that the entropy of the sum of independent Bernoulli random variables is concave in the parameters of the individual random variables. Our proof is a refinement of an argument previously presented by the same authors, which resolved the conjecture in the monotonic case (where all the parameters are simultaneously increasing). In fact, we show that the monotonic case is the worst case, using a careful analysis of concavity properties of the derivatives of the probability mass function. We propose a generalization of Shepp and Olkin's original conjecture, to consider Renyi and Tsallis entropies.

math.PR

Entropy along W_{1,+}-geodesics on graphs

We study the convexity of the entropy functional along particular interpolating curves defined on the space of finitely supported probability measures on a graph.

math.PR

$W_{1,+}$-interpolation of probability measures on graphs

We generalize an equation introduced by Benamou and Brenier, characterizing Wasserstein W_p-geodesics for p > 1, from the continuous setting of probability distributions on a Riemannian manifold to the discrete setting of probability distributions on a general graph. Given an initial and a final distributions f_0 and f_1, we prove the existence of a curve (f_t) satisfying this Benamou-Brenier equation. We also show that such a curve can be described as a mixture of binomial distributions with respect to a coupling that is solution of a certain optimization problem.

math.PR

A natural derivative on [0,n] and a binomial Poincaré inequality

We consider probability measures supported on a finite discrete interval $[0,n]$. We introduce a new finitedifference operator $\nabla_n$, defined as a linear combination of left and right finite differences. We show that this operator $\nabla_n$ plays a key role in a new Poincaré (spectral gap) inequality with respect to binomial weights, with the orthogonal Krawtchouk polynomials acting as eigenfunctions of the relevant operator. We briefly discuss the relationship of this operator to the problem of optimal transport of probability measures.

math.PR

On Prekopa-Leindler inequalities on metric-measure spaces

This work is devoted to the geometric analysis of metric-measure spaces satisfying a Prekopa-Leindler or a more general Borell-Brascamp-Lieb inequality. Completing the early investigations by Cordero-Erausquin, McCann and Schmuckenschlager, we show that these functional inequalities characterize lower bounds on the Ricci curvature on a Riemannian manifold, providing thus an alternate version of Ricci curvature lower bounds in measured length spaces to the recent developments by Lott, Villani and Sturm. We also investigate stability properties and geometric and functional inequalities, such as logarithmic Sobolev inequality and Bishop-Gromov diameter estimate, in measured length spaces satisfying a Prekopa-Leindler or a Borell-Brascamp-Lieb inequality.

math.MG