English
Related papers

Related papers: A Lyapunov type theorem from Kadison-Singer

200 papers

We prove a deterministic analogue of Rudelson's sampling theorem for sums of positive semidefinite matrices. Let $A_1,\dots,A_m$ be positive semidefinite \(d\times d\) matrices, and let $\lambda_1,\dots,\lambda_m \ge 0$ satisfy \[…

Functional Analysis · Mathematics 2026-05-22 Grigory Ivanov

Recently Marcus, Spielman and Srivastava gave a spectacular proof of a theorem which implies a positive solution to the Kadison-Singer problem. We extend (and slightly sharpen) this theorem to the realm of hyperbolic polynomials. A benefit…

Combinatorics · Mathematics 2014-12-02 Petter Brändén

We present a simple solution to a question posed by Candes, Romberg and Tao on the uniform uncertainty principle for Bernoulli random matrices. More precisely, we show that a rectangular k*n random subgaussian matrix (with k < n) has the…

Statistics Theory · Mathematics 2007-06-13 Shahar Mendelson , Alain Pajor , Nicole Tomczak-Jaegermann

We prove a Liouville-type theorem for semilinear parabolic systems of the form $${\partial_t u_i}-\Delta u_i =\sum_{j=1}^{m}\beta_{ij} u_i^ru_j^{r+1}, \quad i=1,2,...,m$$ in the whole space ${\mathbb R}^N\times {\mathbb R}$. Very recently,…

Analysis of PDEs · Mathematics 2015-07-28 Quoc Hung Phan , Philippe Souplet

Let $u:A\to B$ be a bounded linear operator between two $C^*$-algebras $A,B$. The following result was proved by the second author. Theorem 0.1. There is a numerical constant $K_1$ such that for all finite sequences $x_1,\ldots, x_n$ in $A$…

Functional Analysis · Mathematics 2016-09-06 U. Haagerup , Gilles Pisier

Akemann and Anderson made a conjecture about ``paving'' projections in finite dimensional matrix algebras which, if true, would settle the well-known Kadison-Singer problem. We falsify their conjecture by an explicit seqence of…

Operator Algebras · Mathematics 2007-05-23 Nik Weaver

Given a matrix U, using a deterministic method, we extract a "large" submatrix of U'(whose columns are obtained by normalizing those of U) and estimate its smallest and largest singular value. We apply this result to the study of contact…

Functional Analysis · Mathematics 2015-11-16 Pierre Youssef

We show an extension of a probabilistic result of Marcus, Spielman, and Srivastava, which resolved the Kadison-Singer problem, for block diagonal positive semidefinite random matrices. We use this result to show several selector results,…

Classical Analysis and ODEs · Mathematics 2024-05-29 Marcin Bownik

Recently Marcus, Spielman and Srivastava proved Weaver's ${\rm{KS}}_r$ conjecture, which gives a positive solution to the Kadison-Singer problem. Cohen and Br\"and\'en independently extended this result to obtain the arbitrary-rank version…

Combinatorics · Mathematics 2021-06-18 Zhiqiang Xu , Zili Xu , Ziheng Zhu

This paper addresses the problem of improving properties of a linear operator u in $l_2^n$ by restricting it onto coordinate subspaces. We discuss how to reduce the norm of u by a random coordinate restriction, how to approximate u by a…

Functional Analysis · Mathematics 2007-05-23 R. Vershynin

We consider the Schur-Horn problem for normal operators in von Neumann algebras, which is the problem of characterizing the possible diagonal values of a given normal operator based on its spectral data. For normal matrices, this problem is…

Operator Algebras · Mathematics 2015-10-28 Matthew Kennedy , Paul Skoufranis

In 1959, R.V. Kadison and I.M. Singer asked whether each pure state of the algebra of bounded diagonal operators on $\ell^2$, admits a unique state extension to $B(\ell^2)$. The positive answer was given in June 2013 by A. Marcus, D.…

Functional Analysis · Mathematics 2014-09-23 Alain Valette

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…

Combinatorics · Mathematics 2017-03-22 Harrie Hendriks , Martien C. A. van Zuijlen

For a normal measurable operator $a$ affiliated with a von Neumann factor $\mathcal{M}$ we show: If $\mathcal{M}$ is infinite, then there is $\lambda_0\in \mathbb{C}$ so that for $\varepsilon>0$ there are…

Operator Algebras · Mathematics 2023-04-24 Alexei Ber , Matthijs Borst , Fedor Sukochev

The famous results of Koml\'os, Major and Tusn\'ady (see [15] and [17]) state that it is possible to approximate almost surely the partial sums of size n of i.i.d. centered random variables in L p (p > 2) by a Wiener process with an error…

Probability · Mathematics 2017-06-27 Christophe Cuny , Jérôme Dedecker , Florence Merlevède

We establish a general method to produce cofibrant approximations in the model category $U_S(C,D)$ of $S$-valued $C$-indexed diagrams with $D$-weak equivalences and $D$-fibrations. We also present explicit examples of such approximations.…

K-Theory and Homology · Mathematics 2007-05-23 Paul Balmer , Michel Matthey

We first study i.i.d. products of finitely many invertible $2 \times 2$ matrices with positive entries, and prove that the top Lyapunov exponent admits an explicit, rapidly convergent Neumann-series-type representation involving an infinite…

Dynamical Systems · Mathematics 2026-02-27 Nima Alibabaei

This note presents a new proof of an important result due to Bourgain and Tzafriri that provides a partial solution to the Kadison--Singer problem. The result shows that every unit-norm matrix whose entries are relatively small in…

Metric Geometry · Mathematics 2014-04-29 Joel A. Tropp

We sharpen the constant in the $KS_2$ conjecture of Weaver \cite{We}, which was validated by Marcus, Spielman, and Srivastava \cite{MSS} in their solution of the Kadison--Singer problem. We then apply this result to prove optimal asymptotic…

Functional Analysis · Mathematics 2016-06-20 Marcin Bownik , Peter G. Casazza , Adam W. Marcus , Darrin Speegle

Matrix sensing has many real-world applications in science and engineering, such as system control, distance embedding, and computer vision. The goal of matrix sensing is to recover a matrix $A_\star \in \mathbb{R}^{n \times n}$, based on a…

Data Structures and Algorithms · Computer Science 2023-03-23 Lianke Qin , Zhao Song , Ruizhe Zhang