Optimal splitting of Parseval frames using Walsh matrices

From MaRDI portal



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.












This page was built for publication: Optimal splitting of Parseval frames using Walsh matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224454)