Rational sphere maps, linear programming, and compressed sensing
Preprint
Abstract
We develop a link between degree estimates for rational sphere maps and compressed sensing. We provide several new ideas and many examples, both old and new, that amplify connections with linear programming. We close with a list of ten open problems.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Symmetries in CR complexity theoryAdvances in Mathematics, 2017
- Homotopy equivalence for proper holomorphic mappingsAdvances in Mathematics, 2016
- Bounding the rank of Hermitian forms and rigidity for CR mappings of hyperquadricsMathematische Annalen, 2013
- On the third gap for proper holomorphic maps between ballsMathematische Annalen, 2013
- Uniqueness of certain polynomials constant on a lineLinear Algebra and its Applications, 2010
- COMPLEXITY RESULTS FOR CR MAPPINGS BETWEEN SPHERESInternational Journal of Mathematics, 2009
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- A sharp bound for the degree of proper monomial mappings between ballsThe Journal of Geometric Analysis, 2003
- Extending proper holomorphic mappings of positive codimensionInventiones Mathematicae, 1989
- Maps from the two-ball to the three-ballInventiones Mathematicae, 1982