On Structural Decompositions of Finite Frames
Alice Z.-Y. Chan, Martin S. Copenhaver, Sivaram K. Narayan, Logan, Stokols, and Allison Theobold

TL;DR
This paper explores the combinatorial structure of finite frames in Hilbert spaces, introducing posets to analyze their decompositions into tight or scalable subsets, and investigates the inverse problem of realizing specific poset structures.
Contribution
It defines factor and scalability posets for frames, establishes conditions for their properties, and studies the inverse problem of constructing frames with prescribed poset structures.
Findings
Necessary and sufficient conditions for factor posets in $H_2$
Preservation of factor poset structure under orthogonal projections
Bounds on the size and enumeration of factor posets
Abstract
A frame in an -dimensional Hilbert space is a possibly redundant collection of vectors that span the space. A tight frame is a generalization of an orthonormal basis. A frame is said to be scalable if there exist nonnegative scalars such that 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 to be a collection of subsets of ordered by inclusion so that nonempty is in the factor poset if and only if is a tight frame for . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
