A redundant version of the Rado-Horn theorem

DOI10.1016/j.laa.2006.01.010zbMath1103.15001OpenAlexW2157215689MaRDI QIDQ852617

Gitta Kutyniok, Darrin M. Speegle, Peter G. Casazza

Publication date: 15 November 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.01.010

zbMATH Keywords

redundant systempartition into linearly independent setsRado-Horn theorem

Mathematics Subject Classification ID

Partitions of sets (05A18) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

Linearly connected sequences and spectrally optimal dual frames for erasures ⋮ An elementary, illustrative proof of the Rado-Horn theorem ⋮ A quantitative notion of redundancy for finite frames ⋮ An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator ⋮ Spanning and independence properties of frame partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of Riesz frames and wavelets into a finite union of linearly independent sets
• Frames and the Feichtinger conjecture
• A Combinatorial Theorem on Vector Spaces
• A Characterization of Union of Linearly Independent Sets