| dc.contributor |
Massachusetts Institute of Technology. Department of Mathematics |
|
| dc.creator |
Hamilton, Linus |
|
| dc.creator |
Moitra, Ankur |
|
| dc.date |
2021-11-09T19:20:41Z |
|
| dc.date |
2021-11-09T15:20:36Z |
|
| dc.date |
2021-11-09T19:20:41Z |
|
| dc.date |
2019 |
|
| dc.date |
2019-11-15T18:30:04Z |
|
| dc.date.accessioned |
2023-03-01T18:12:18Z |
|
| dc.date.available |
2023-03-01T18:12:18Z |
|
| dc.identifier |
https://hdl.handle.net/1721.1/137918.2 |
|
| dc.identifier |
Hamilton, Linus and Moitra, Ankur. 2019. "The Paulsen Problem Made Simple." |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/279146 |
|
| dc.description |
© Linus Hamilton and Ankur Moitra. 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 -nearly equal norm Parseval frame in d dimensions is within squared distance O(?d13/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(ϵd2). |
|
| dc.description |
NSF (Awards CCF-1453261, CCF-1565235) |
|
| dc.format |
application/octet-stream |
|
| dc.language |
en |
|
| dc.relation |
10.4230/LIPIcs.ITCS.2019.41 |
|
| dc.rights |
Creative Commons Attribution 4.0 International license |
|
| dc.rights |
https://creativecommons.org/licenses/by/4.0/ |
|
| dc.source |
DROPS |
|
| dc.title |
The Paulsen Problem Made Simple |
|
| dc.type |
Article |
|
| dc.type |
http://purl.org/eprint/type/ConferencePaper |
|