Sparse representation of vectors in lattices and semigroups
From MaRDI portal
Publication:2118144
Recommendations
- Optimizing sparsity over lattices and semigroups
- Sparse Solutions of Linear Diophantine Equations
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Sparsity of integer solutions in the average case
- Sparse Approximate Solutions to Linear Systems
Cites work
- A geometric inequality with applications to linear forms
- A graph partition problem
- A survey of compressed sensing
- An algebraic perspective on integer sparse recovery
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Carathéodory bounds for integer cones
- Complexity of short Presburger arithmetic
- Decoding by Linear Programming
- Effective lattice point counting in rational convex polytopes
- scientific article; zbMATH DE number 3987367 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1970438 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- Matching structure and the matching lattice
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- On the recovery of an integer vector from linear measurements
- Optimizing sparsity over lattices and semigroups
- PROMP: a sparse recovery approach to lattice-valued signals
- Short rational generating functions for lattice point problems
- Sparse Approximate Solutions to Linear Systems
- Sparse Solutions of Linear Diophantine Equations
- Sparsity of integer solutions in the average case
- Spatial Compressive Sensing for MIMO Radar
- Stable signal recovery from incomplete and inaccurate measurements
- The distributions of functions related to parametric integer optimization
- The lattice of cycles of an undirected graph
- The support of integer optimal solutions
Cited in
(20)- On sparse geometry of numbers
- Generalized flatness constants, spanning lattice polytopes, and the Gromov width
- Low-weight halfspaces for sparse boolean vectors
- On Sparse Representations in Arbitrary Redundant Bases
- Optimizing sparsity over lattices and semigroups
- scientific article; zbMATH DE number 6607548 (Why is no real title available?)
- Did you say parsimony
- New Bounds for the Integer Carathéodory Rank
- On -modular integer linear problems in the canonical form and equivalent problems
- Sparse approximation in lattices and semigroups
- On the smallest support size of integer solutions to linear equations
- New support size bounds for integer programming, applied to makespan minimization on uniformly related machines
- Integer Carathéodory results with bounded multiplicity
- Integer points in arbitrary convex cones: the case of the PSD and SOC cones
- On matrices over a polynomial ring with restricted subdeterminants
- Sparsity and integrality gap transference bounds for integer programs
- Integer points in arbitrary convex cones: the case of the PSD and SOC cones
- Sparsity and proximity transference in integer programming
- A threshold phenomenon for the shortest lattice vector problem in the infinity norm
- A note on sparse solutions of sparse linear systems
This page was built for publication: Sparse representation of vectors in lattices and semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118144)
