The Paulsen problem made simple

DOI10.4230/LIPICS.ITCS.2019.41MaRDI QIDQ5090418zbMATH OpenFDO

Authors Linus Hamilton, Ankur Moitra

Publication date 18 July 2022

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

zbMATH Keywords

operator scalingPaulsen problemradial isotropic position

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The Paulsen problem made simple
• The Paulsen problem in operator theory
• The Paulsen problem, continuous operator scaling, and smoothed analysis
• The road to equal-norm Parseval frames
• Paulsen problem for A-admissible frames

Cites work

• A linear lower bound on the unbounded error probabilistic communication complexity.
• Classical complexity and quantum entanglement
• scientific article; zbMATH DE number 4103721 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• On a reverse form of the Brascamp-Lieb inequality
• Superquadratic lower bound for 3-query locally correctable codes over the reals
• The Brascamp-Lieb inequalities: Finiteness, structure and extremals
• The Paulsen problem, continuous operator scaling, and smoothed analysis

Cited in

(4)

• On the search for tight frames of low coherence
• The Paulsen Problem Made Simple
• A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning
• Optimization, complexity and invariant theory (invited talk)

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 Q5090418)