Optimal splitting of Parseval frames using Walsh matrices
Functional Analysis
2020-07-28 v1
Abstract
In 2014 Adam Marcus, Daniel Spielman and Nikhil Srivastava used random vectors to prove a key discrepancy theorem and in so doing gave a positive answer to the long-standing Kadison-Singer Problem. In this paper we use Walsh matrices to construct a class of natural frames in Euclidean space and discuss how these frames relate to the key discrepancy theorem.
Cite
@article{arxiv.2007.13026,
title = {Optimal splitting of Parseval frames using Walsh matrices},
author = {Amie Albrecht and Phil Howlett and Geetika Verma},
journal= {arXiv preprint arXiv:2007.13026},
year = {2020}
}
Comments
21 pages