A Characterization of Union of Linearly Independent Sets
From MaRDI portal
Cited in
(12)- Fast approximation of matroid packing and covering
- An elementary, illustrative proof of the Rado-Horn theorem
- Linearly connected sequences and spectrally optimal dual frames for erasures
- The rank formula of Nash-Williams as a source of covering and packing theorems
- Spanning and independence properties of frame partitions
- Kirillov's orbit method and polynomiality of the faithful dimension of p-groups
- On subgaussian random variables
- An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator
- Infinite Matroids
- How to see the forest despite the trees
- Ramsey-type problems for generalised Sidon sets
- A redundant version of the Rado-Horn theorem
This page was built for publication: A Characterization of Union of Linearly Independent Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5850626)