Sébastien Darses
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
Research Subjects
Sébastien Darses has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Stéphane Chrétien
Université Lumière Lyon 2
6 shared publications - Erwan Hillion
Aix Marseille Univ, CNRS, I2M Marseille, France
4 shared publications - Joseph Najnudel
University of Bristol, Bristol, UK
2 shared publications - Christophe Guyeux
University of Franche-Comte
1 shared publication Cnrs Aix Marseille Univ
1 shared publication- François Alouges
Centre Borelli, ENS Paris-Saclay, CNRS, Université Paris-Saclay, 4 Avenue des Sciences, 91190 Gif-sur-Yvette, France
1 shared publication
Latest Publications
- 20 September 2024
- Published by Springer Nature in The Ramanujan Journal
- Vol. 65 (3) , 1421-1447
Multiple integral formulas for weighted zeta moments: the case of the sixth moment
- 20 September 2024
- Published by Springer Nature in The Ramanujan Journal
- Vol. 65 (3) , 1421-1447
Multiple integral formulas for weighted zeta moments: the case of the sixth moment
- 1 January 2024
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- Vol. 212 (3) , 225-254
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}|\Gamma (s)\zeta (s)|^2\,dt$ on the whole critical line $s=1/2+it$. They are finite sums involving binomial coefficients, Bernoulli numbers, Stirling numbers and $\pi $, in particular- 1 January 2024
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- Vol. 212 (3) , 225-254
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}|\Gamma (s)\zeta (s)|^2\,dt$ on the whole critical line $s=1/2+it$. They are finite sums involving binomial coefficients, Bernoulli numbers, Stirling numbers and $\pi $, in particular- Open Access
Multiple integral formulas for weighted zeta moments: the case of the sixth moment
We prove exact formulas for weighted $2k$th moments of the Riemann zeta function for all integer $k\geq 1$ in terms of the analytic continuation of an auto-correlation function. This latter enjoys several functional equations. One of them, following from a fundamental lemma of Bettin and Conrey (2013), yields to new formulas for the moments: our second main result is the case $k=3$, but there is no obstruction to obtain higher moments. This generalizes results by Titchmarsh (1928) for $k=1$ and $k=2$. A basic and powerful tool is a special Fourier transform unveiled by Ramanujan (1915). In a nutshell, the new idea is to consider the associated structures to $Γ^kζ^k$, which enjoy remarkable properties that are not satisfied by the more classically studied structure $Γζ^k$.Open AccessMultiple integral formulas for weighted zeta moments: the case of the sixth moment
We prove exact formulas for weighted $2k$th moments of the Riemann zeta function for all integer $k\geq 1$ in terms of the analytic continuation of an auto-correlation function. This latter enjoys several functional equations. One of them, following from a fundamental lemma of Bettin and Conrey (2013), yields to new formulas for the moments: our second main result is the case $k=3$, but there is no obstruction to obtain higher moments. This generalizes results by Titchmarsh (1928) for $k=1$ and $k=2$. A basic and powerful tool is a special Fourier transform unveiled by Ramanujan (1915). In a nutshell, the new idea is to consider the associated structures to $Γ^kζ^k$, which enjoy remarkable properties that are not satisfied by the more classically studied structure $Γζ^k$. - Open Access
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 $\theta_k\in(0,1)$, $k\ge1$. Randomizing the $\theta_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 $\sigma_0\in(1/2,1)$, and imply $\zeta(\sigma+it)\neq 0$ in the strip $1/2<\sigma\le\sigma_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.Open AccessPolynomial 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 $\theta_k\in(0,1)$, $k\ge1$. Randomizing the $\theta_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 $\sigma_0\in(1/2,1)$, and imply $\zeta(\sigma+it)\neq 0$ in the strip $1/2<\sigma\le\sigma_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. - Open Access
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 $\theta_k\in(0,1)$, $k\ge1$. We develop probabilistic extensions of the Nyman-Beurling criterion by considering these $\theta_k$ as random: this yields new structures and criteria, one of them having a significant overlap with the general strong B\'aez-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\'aez-Duarte in 2005: the price to pay to consider non compactly supported kernels is a controlled condition on the coefficients of the involved approximations.Open AccessOn 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 $\theta_k\in(0,1)$, $k\ge1$. We develop probabilistic extensions of the Nyman-Beurling criterion by considering these $\theta_k$ as random: this yields new structures and criteria, one of them having a significant overlap with the general strong B\'aez-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\'aez-Duarte in 2005: the price to pay to consider non compactly supported kernels is a controlled condition on the coefficients of the involved approximations. - Open Access
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].
Open AccessAn 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].
- Open Access
- 1 January 2017
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 7 (3) , 289-299
On the pinning controllability of complex networks using perturbation theory of extreme singular values. application to synchronisation in power grids
Pinning control on complex dynamical networks has emerged as a very important topic in recent trends of control theory due to the extensive study of collective coupled behaviors and their role in physics, engineering and biology. In practice, real-world networks consist of a large number of vertices and one may only be able to perform a control on a fraction of them only. Controllability of such systems has been addressed in [17], where it was reformulated as a global asymptotic stability problem. The goal of this short note is to refine the analysis proposed in [17] using recent results in singular value perturbation theory.
- 1 January 2017
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 7 (3) , 289-299
Open AccessOn the pinning controllability of complex networks using perturbation theory of extreme singular values. application to synchronisation in power grids
Pinning control on complex dynamical networks has emerged as a very important topic in recent trends of control theory due to the extensive study of collective coupled behaviors and their role in physics, engineering and biology. In practice, real-world networks consist of a large number of vertices and one may only be able to perform a control on a fraction of them only. Controllability of such systems has been addressed in [17], where it was reformulated as a global asymptotic stability problem. The goal of this short note is to refine the analysis proposed in [17] using recent results in singular value perturbation theory.
- Open Access
An elementary approach to the problem of column selection in a rectangular matrix
The problem of extracting a well conditioned submatrix from any rectangular matrix (with normalized columns) has been studied for some time in functional and harmonic analysis; see \cite{BourgainTzafriri:IJM87,Tropp:StudiaMath08,Vershynin:IJM01} for methods using random column selection. More constructive approaches have been proposed recently; see the recent contributions of \cite{SpielmanSrivastava:IJM12,Youssef:IMRN14}. The column selection problem we consider in this paper is concerned with extracting a well conditioned submatrix, i.e. a matrix whose singular values all lie in $[1-\epsilon,1+\epsilon]$. We provide individual lower and upper bounds for each singular value of the extracted matrix at the price of conceding only one log factor in the number of columns, when compared to the Restricted Invertibility Theorem of Bourgain and Tzafriri. Our method is fully constructive and the proof is short and elementary.Open AccessAn elementary approach to the problem of column selection in a rectangular matrix
The problem of extracting a well conditioned submatrix from any rectangular matrix (with normalized columns) has been studied for some time in functional and harmonic analysis; see \cite{BourgainTzafriri:IJM87,Tropp:StudiaMath08,Vershynin:IJM01} for methods using random column selection. More constructive approaches have been proposed recently; see the recent contributions of \cite{SpielmanSrivastava:IJM12,Youssef:IMRN14}. The column selection problem we consider in this paper is concerned with extracting a well conditioned submatrix, i.e. a matrix whose singular values all lie in $[1-\epsilon,1+\epsilon]$. We provide individual lower and upper bounds for each singular value of the extracted matrix at the price of conceding only one log factor in the number of columns, when compared to the Restricted Invertibility Theorem of Bourgain and Tzafriri. Our method is fully constructive and the proof is short and elementary. - Open Access
Controllability of complex networks using perturbation theory of extreme singular values
Pinning control on complex dynamical networks has emerged as a very important topic in recent trends of control theory due to the extensive study of collective coupled behaviors and their role in physics, engineering and biology. In practice, real-world networks consists of a large number of vertices and one may only be able to perform a control on a fraction of them only. Controllability of such systems has been addressed in \cite{PorfiriDiBernardo:Automatica08}, where it was reformulated as a global asymptotic stability problem. The goal of this short note is to refine the analysis proposed in \cite{PorfiriDiBernardo:Automatica08} using recent results in singular value perturbation theory.
Open AccessControllability of complex networks using perturbation theory of extreme singular values
Pinning control on complex dynamical networks has emerged as a very important topic in recent trends of control theory due to the extensive study of collective coupled behaviors and their role in physics, engineering and biology. In practice, real-world networks consists of a large number of vertices and one may only be able to perform a control on a fraction of them only. Controllability of such systems has been addressed in \cite{PorfiriDiBernardo:Automatica08}, where it was reformulated as a global asymptotic stability problem. The goal of this short note is to refine the analysis proposed in \cite{PorfiriDiBernardo:Automatica08} using recent results in singular value perturbation theory.
- 21 April 2015
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 143 (10) , 4383-4388
On the spacings between the successive zeros of the Laguerre polynomials
We propose a simple uniform lower bound on the spacings between the successive zeros of the Laguerre polynomials <!-- MATH $L_n^{(\alpha )}$ --> for all <!-- MATH $\alpha >-1$ --> -1$">. Our bound is sharp regarding the order of dependency on and in various ranges. In particular, we recover the orders given in a work of Ahmed, Laforgia and Muldoon (1982) for <!-- MATH $\alpha \in (-1,1]$ --> .- 21 April 2015
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 143 (10) , 4383-4388
On the spacings between the successive zeros of the Laguerre polynomials
We propose a simple uniform lower bound on the spacings between the successive zeros of the Laguerre polynomials <!-- MATH $L_n^{(\alpha )}$ --> for all <!-- MATH $\alpha >-1$ --> -1$">. Our bound is sharp regarding the order of dependency on and in various ranges. In particular, we recover the orders given in a work of Ahmed, Laforgia and Muldoon (1982) for <!-- MATH $\alpha \in (-1,1]$ --> .