2000 character limit reached
The Paulsen Problem Made Simple
Published 13 Sep 2018 in math.FA, cs.DS, and math.OC | (1809.04726v2)
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 d2)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.