Related papers: On Wielandt-Mirsky's conjecture for matrix polynom…
An explicit bound is given for the Kolmogorov distance between a mixture of normal distributions and a normal distribution with properly chosen parameter values. A random variable X has a mixture of normal distributions if its conditional…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
The well-known Lvov-Kaplansky conjecture states that the image of a multilinear polynomial $f$ evaluated on $n\times n$ matrices is a vector space. A weaker version of this conjecture, known as the Mesyan conjecture, states that if $m=deg(…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
Given a determinate (multivariate) probability measure $\mu$, we characterize Gaussian mixtures $\nu\_\phi$ which minimize the Wasserstein distance $W\_2(\mu,\nu\_\phi)$ to $\mu$ when the mixing probability measure $\phi$ on the parameters…
This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules $ {\bf M}_\mu$ and corresponding elements of the Macdonald basis. We recall that ${\bf M}_\mu$ is defined for a partition $\mu\part…
Finsler's Lemma charactrizes all pairs of symmetric $n \times n$ real matrices $A$ and $B$ which satisfy the property that $v^T A v>0$ for every nonzero $v \in \mathbb{R}^n$ such that $v^T B v=0$. We extend this characterization to all…
In nonparametric statistical problems, we wish to find an estimator of an unknown function f. We can split its error into bias and variance terms; Smirnov, Bickel and Rosenblatt have shown that, for a histogram or kernel estimate, the…
We establish inequalities that compare the p-Wasserstein distance to distances which are built as suprema of box measures. More precisely, when the measures are supported on $[0,1]^d$, we obtain sharp upper-bounds of the $p$-Wasserstein…
We revise and extend the algorithm provided in [1] to compute the finite Connes' distance between normal states. The original formula in [1] contains an error and actually only provides a lower bound. The correct expression, which we…
The classical Berry-Esseen error bound, for the normal approximation to the law of a sum of independent and identically distributed random variables, is here improved by replacing the standardised third absolute moment by a weak norm…
Given an $m\times n$ binary matrix $M$ with $|M|=p\cdot mn$ (where $|M|$ denotes the number of 1 entries), define the discrepancy of $M$ as $\mbox{disc}(M)=\displaystyle\max_{X\subset [m], Y\subset [n]}\big||M[X\times Y]|-p|X|\cdot…
The Brunn-Minkowski inequality, applicable to bounded measurable sets $A$ and $B$ in $\mathbb{R}^d$, states that $|A+B|^{1/d} \geq |A|^{1/d}+|B|^{1/d}$. Equality is achieved if and only if $A$ and $B$ are convex and homothetic sets in…
If one thinks of a Riemannian metric, $g_1$, analogously as the gradient of the corresponding distance function, $d_1$, with respect to a background Riemannian metric, $g_0$, then a natural question arises as to whether a corresponding…
The Komlos conjecture in discrepancy theory states that for some constant K and for any m by n matrix A whose columns lie in the unit ball there exists a +/- 1 vector x such that the infinity norm of Ax is bounded above by K. This…
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. Tsitsiklis Lyapunov function is shown to be the Hilbert distance to consensus in log coordinates. Birkhoff theorem, which proves contraction of…
For a smooth strongly convex Minkowski norm $F:\mathbb{R}^n \to \mathbb{R}_{\geq0}$, we study isometries of the Hessian metric corresponding to the function $E=\tfrac12F^2$. Under the additional assumption that $F$ is invariant with respect…
We derive some localization and perturbation results for coneigenvalues of quaternion matrices. In localization results, we derive Ger\v{s}gorin type theorems for right and left coneigenvalues of quaternion matrices. We prove that certain…
Let $\|\!\cdot\!\|_p$ denote the Schatten $p$-norm of matrices and $\|\!\cdot\!\|_F$ the Frobenius norm. For a square matrix $X$, let $|X|$ denote its absolute value. In 2010, Eun-Young Lee posed the problem of determining the smallest…
Let $A \in \mathbb{R}^{n \times (n - d)}$ be a random matrix with independent uniformly anti-concentrated entries satisfying $\mathbb{E}\lvert A\rvert_{HS}^2 \leq Kn(n-d)$ and let $H$ be the subspace spanned by the columns of $A$. Let $X…