On structural decompositions of finite frames

DOI10.1007/S10444-015-9440-1MaRDI QIDQ295388zbMATHOpenAlexFDO

Authors Martin S. Copenhaver, S. K. Narayan, Allison Theobold, Alice Zhuo-Yu Chan, Logan F. Stokols

Publication date 13 June 2016

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

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

zbMATH Keywords

framestight frameserasure resilienceerasuresframe decompositionsprime frames

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics of partially ordered sets (06A07) Vector spaces, linear dependence, rank, lineability (15A03)

Abstract: A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors ${f_i}_{iinI}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame ${f_i}_{iinI}$ is said to be scalable if there exist nonnegative scalars ${c_i}_{iinI}$ such that ${c_i{f}_i}_{iinI}$ 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_i}_{iinI}$ to be a collection of subsets of $I$ ordered by inclusion so that nonempty $JsubseteqI$ is in the factor poset if and only if ${f_j}_{jinJ}$ is a tight frame for $H_n$. 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 $H_n$ which is also sufficient for $H_2$. 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.

Recommendations

• Factor posets of frames and dual frames in finite dimensions
• Scalable frames
• Scalable frames and convex geometry
• What is a Frame? Theory and Applications of Frames
• Prime tight frames

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• A Class of Nonharmonic Fourier Series
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• An identity in combinatorial extremal theory
• An introduction to frames and Riesz bases
• Computing Partitions with Applications to the Knapsack Problem
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Diagram vectors and tight frame scaling in finite dimensions
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Equal-norm tight frames with erasures
• Factor posets of frames and dual frames in finite dimensions
• Factors of sums of powers of binomial coefficients
• Finite frames. Theory and applications.
• Frames for undergraduates
• Frames, bases and group representations
• Frames, graphs and erasures
• Full spark frames
• Introduction to algorithms.
• Maximum robustness and surgery of frames in finite dimensions
• On generalized graphs
• On the maximum number of balancing subsets
• Optimal frames for erasures.
• Painless nonorthogonal expansions
• Prime tight frames
• Quantized frame expansions with erasures
• Robustness and surgery of frames
• Scalable frames
• Scalable frames and convex geometry
• Ten Lectures on Wavelets
• The maximum number of balancing sets
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property

Cited in

(11)

• Mini-workshop: Algebraic, geometric, and combinatorial methods in frame theory. Abstracts from the mini-workshop held September 30 -- October 6, 2018
• Assur decompositions of direction-length frameworks
• Scalable frames and convex geometry
• Minimal scalings and structural properties of scalable frames
• Prime tight frames
• Alpha-expansions: A class of frame decompositions
• Spanning and independence properties of finite frames
• Frame decomposition of decomposition spaces
• Factor posets of frames and dual frames in finite dimensions
• Diagram vectors and tight frame scaling in finite dimensions
• On root frames in \(\mathbb{R}^d\)

Describes a project that uses

Uses Software

• APOGEE

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)