MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

On structural decompositions of finite frames

Author(s)
Stokols, Logan; Theobold, Allison; Chan, Alice Z.-Y.; Narayan, Sivaram K.; Copenhaver, Martin Steven
Thumbnail
Download10444_2015_9440_ReferencePDF.pdf (346.7Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
A frame in an n-dimensional Hilbert space Hn is a possibly redundant collection of vectors {f[subscript i]}[subscript i∈I] that span the space. A tight frame is a generalization of an orthonormal basis. A frame {f[subscript i]}[subscript i∈I] is said to be scalable if there exist nonnegative scalars {c[subscript i]}[subscript i∈I] such that {c[subscript i]f[subscript i]}[subscript i∈I] 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 {f[subscript i]}[subscript i∈I] to be a collection of subsets of I ordered by inclusion so that nonempty J⊆I is in the factor poset iff {f[subscript j]}[subscript j∈J] is a tight frame for Hn. We study various properties of factor posets and address the inverse factor poset problem, which inquires when there exists a frame whose factor poset is some given poset P. 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; in doing so we present a bridge between erasure resilience (as studied via prime tight frames) and scalability.
Date issued
2015-10
URI
http://hdl.handle.net/1721.1/107123
Department
Massachusetts Institute of Technology. Operations Research Center; Sloan School of Management
Journal
Advances in Computational Mathematics
Publisher
Springer US
Citation
Chan, Alice Z.-Y., Martin S. Copenhaver, Sivaram K. Narayan, Logan Stokols, and Allison Theobold. “On Structural Decompositions of Finite Frames.” Adv Comput Math 42, no. 3 (October 30, 2015): 721–756.
Version: Author's final manuscript
ISSN
1019-7168
1572-9044

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.