Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Paulsen Problem Made Simple (1809.04726v2)

Published 13 Sep 2018 in math.FA, cs.DS, and math.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 d2)$.

Citations (20)

Summary

We haven't generated a summary for this paper yet.