The Paulsen problem made simple (Q2130546): Difference between revisions

It was observed that the Paulsen problem was one of the most applicable problems in frame theory. Recently, \textit{T. C. Kwok} et al. [in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 182--189 (2018; Zbl 1490.42034)] showed that every \(\varepsilon\)-nearly equal norm Parseval frame in \(d\)-dimensions is within squared distance \(O(\varepsilon d^{\frac{13}{2}})\) of an equal norm Parseval frame. In the present paper, a simpler proof based on the notion of radial isotropic position has been given. Also, an improved bound of \(O(\varepsilon d^{2})\) has been obtained.