Sparse Solutions of Linear Diophantine Equations

DOI10.1137/16M1083876zbMath1370.13022arXiv1602.00344MaRDI QIDQ5737776

Timm Oertel, Christopher O'Neill, Jesús A. De Loera, Iskander M. Aliev

Publication date: 30 May 2017

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

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

zbMATH Keywords

optimizationinteger programmingdiscrete geometry

Mathematics Subject Classification ID

Integer programming (90C10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items (13)

Optimizing Sparsity over Lattices and Semigroups ⋮ The Support of Integer Optimal Solutions ⋮ On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases ⋮ Factorization length distribution for affine semigroups. I: Numerical semigroups with three generators ⋮ New Bounds for the Integer Carathéodory Rank ⋮ The Distributions of Functions Related to Parametric Integer Optimization ⋮ On sparse geometry of numbers ⋮ Distance-Sparsity Transference for Vertices of Corner Polyhedra ⋮ Minkowski's successive minima in convex and discrete geometry ⋮ Augmented Hilbert series of numerical semigroups ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ The integrality number of an integer program ⋮ Sparse representation of vectors in lattices and semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Siegel's lemma
• An integer analogue of Carathéodory's theorem
• The best constant in Siegel's Lemma
• A property of polynomials with an application to Siegel's lemma
• Combinatorics and commutative algebra.
• On factorization invariants and Hilbert functions
• On the set of elasticities in numerical monoids
• On the (co)girth of a connected matroid
• Carathéodory bounds for integer cones
• Siegel's Lemma and sum-distinct sets
• A Linear Programming Approach to the Cutting-Stock Problem
• Decoding by Linear Programming
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Deterministic Approximation Algorithms for the Nearest Codeword Problem
• A counterexample to an integer analogue of Carathéodory's theorem
• The intractability of computing the minimum distance of a code
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: Sparse Solutions of Linear Diophantine Equations