arXiv subjects

Sebastien Darses

Publications and source records attributed to Sebastien Darses.

6 recordsLinked to original sources

arXiv2025

On twisted period functions and Moments of a weighted mean square of Dirichlet L-functions on the critical line

We extend to Dirichlet L-functions associated with arbitrary primitive characters a range of objects and properties -- including Eisenstein series and period functions -- that were originally introduced and studied by Lewis and Zagier (2001), and later by Bettin and Conrey (2013) in the case of the Riemann zeta function, and more recently by Lewis and Zagier (2019) for odd real characters. These tools yield closed-form expressions for the moments of a measure defined via a weighted mean square of the L-function. These moments not only provide a complete characterization of the modulus of the L-function on the critical line, but also imply an infinite number of non-trivial positivity conditions valid for all primitive characters, real or not. The methods also involve a general form of an asymptotic formula based on the shifted Euler--Maclaurin summation formula, which may be of independent interest.

math.NT↗

arXiv2016

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-ε,1+ε]$. 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.

math.FA↗

arXiv2016

On the generic uniform uniqueness of the LASSO estimator

The LASSO is a variable subset selection procedure in statistical linear regression based on $\ell_1$ penalization of the least-squares operator. Uniqueness of the LASSO is an important issue, especially for the study of the LASSO path. The goal of the present paper is to provide a generic sufficient condition on the design matrix for the LASSO minimizer to be unique. Unlike previous works on the question of uniqueness, our condition only depends on the design matrix. Our study is based on a general position condition on the design matrix which holds with probability one for most experimental models.

math.ST↗

arXiv2016

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.

math.OC↗

arXiv2014

Perturbation bounds on the extremal singular values of a matrix after appending a column

In this paper, we study the perturbation of the extreme singular values of a matrix in the particular case where it is obtained after appending an arbitrary column vector. Such results have many applications in bifurcation theory, signal processing, control theory and many other fields. In the first part of this paper, we review and compare various bounds from recent research papers on this subject. We also present a new lower bound and a new upper bound on the perturbation of the operator norm is provided. Simple proofs are provided, based on the study of the characteristic polynomial rather than on variational methods, as e.g. in \cite{Li-Li}. In a second part of the paper, we present applications to signal processing and control theory.

math.SP↗

arXiv2014

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 $L_n^{(α)}$ for all $α>-1$. Our bound is sharp regarding the order of dependency on $n$ and $α$ in various ranges. In particular, we recover the orders given in \cite{ahmed} for $α\in (-1,1]$.

math.CA↗