The Paulsen Problem Made Simple

DOI10.4230/LIPICS.ITCS.2019.41MaRDI QIDQ6306654arXivFDO

Authors Linus Hamilton, Ankur Moitra

Publication date 12 September 2018

Published in arXiv

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2019.41

Mathematics Subject Classification ID

Theory of computing (68Qxx)

arXiv classification

cs.DSmath.FAmath.OC

Abstract: The Paulsen problem is a basic problem in operator theory that was resolved in a recent tour-de-force work of Kwok, Lau, Lee and Ramachandran. In particular, they showed that every $epsilon$-nearly equal norm Parseval frame in $d$ dimensions is within squared distance $O(epsilon{d}^{13/2})$ of an equal norm Parseval frame. We give a dramatically simpler proof based on the notion of radial isotropic position, and along the way show an improved bound of $O(epsilon{d}^2)$.

This page was built for publication: The Paulsen Problem Made Simple

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6306654)