On structural decompositions of finite frames

From MaRDI portal
Publication:295388

DOI10.1007/S10444-015-9440-1zbMATH Open1338.05029arXiv1411.6138OpenAlexW3121471047MaRDI QIDQ295388FDOQ295388


Authors: Martin S. Copenhaver, S. K. Narayan, Allison Theobold, Alice Zhuo-Yu Chan, Logan F. Stokols Edit this on Wikidata


Publication date: 13 June 2016

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Abstract: A frame in an n-dimensional Hilbert space Hn is a possibly redundant collection of vectors fiiinI that span the space. A tight frame is a generalization of an orthonormal basis. A frame fiiinI is said to be scalable if there exist nonnegative scalars ciiinI such that cifiiinI is a tight frame. In this paper we study the combinatorial structure of frames and their decomposition into tight or scalable subsets by using partially-ordered sets (posets). We define the factor poset of a frame fiiinI to be a collection of subsets of I ordered by inclusion so that nonempty JsubseteqI is in the factor poset if and only if fjjinJ is a tight frame for Hn. A similar definition is given for the scalability poset of a frame. We prove conditions which factor posets satisfy and use these to study the inverse factor poset problem, which inquires when there exists a frame whose factor poset is some given poset P. We determine a necessary condition for solving the inverse factor poset problem in Hn which is also sufficient for H2. We describe how factor poset structure of frames is preserved under orthogonal projections. We also consider the enumeration of the number of possible factor posets and bounds on the size of factors posets. We then turn our attention to scalable frames and present partial results regarding when a frame can be scaled to have a given factor poset.


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




Recommendations




Cites Work


Cited In (11)

Uses Software





This page was built for publication: On structural decompositions of finite frames

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