Four deviations suffice for rank 1 matrices

DOI10.1016/j.aim.2020.107366zbMath1460.11106arXiv1901.06731OpenAlexW3070214604MaRDI QIDQ2213767

Rasmus Kyng, Zhao Song, Kyle Luh

Publication date: 3 December 2020

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.06731

zbMATH Keywords

operator algebraLyapunov theoreminterlacing polynomialsmatrix discrepancy

Mathematics Subject Classification ID

General theory of (C^*)-algebras (46L05) Enumerative combinatorics (05A99) Irregularities of distribution, discrepancy (11K38)

Related Items (2)

A Spectral Approach to Network Design ⋮ Upper and lower bounds for matrix discrepancy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• User-friendly tail bounds for sums of random matrices
• On the zeros of convex combinations of polynomials
• The roots of the independence polynomial of a clawfree graph
• Applications of stable polynomials to mixed determinants: Johnson's conjectures, unimodality, and symmetrized Fischer products
• Random vectors in the isotropic position
• Corrigendum: Obreschkoff's theorem revisited: What convex sets are contained in the set of hyperbolic polynomials?
• The Kadison-Singer problem in discrepancy theory.
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• Multivariate stable polynomials: theory and applications
• Six Standard Deviations Suffice
• Lyapunov theorems for operator algebras
• Strong converse for identification via quantum channels
• Twice-Ramanujan Sparsifiers
• A Lyapunov-type theorem from Kadison-Singer

This page was built for publication: Four deviations suffice for rank 1 matrices