Sparse Solutions of Linear Diophantine Equations
From MaRDI portal
Abstract: We present structural results on solutions to the Diophantine system , with the smallest number of non-zero entries. Our tools are algebraic and number theoretic in nature and include Siegel's Lemma, generating functions, and commutative algebra. These results have some interesting consequences in discrete optimization.
Recommendations
- Solving sparse linear equations over finite fields
- Efficient solution of linear diophantine equations
- scientific article; zbMATH DE number 1684382
- Sparse algebraic equations over finite fields
- Using sparse interpolation to solve multivariate Diophantine equations
- scientific article; zbMATH DE number 1254015
- On solving sparse algebraic equations over finite fields
- Solving linear Diophantine equations using the geometric structure of the solution space
- Linear Diophantine equations in several variables
Cites work
- A counterexample to an integer analogue of Carathéodory's theorem
- A Linear Programming Approach to the Cutting-Stock Problem
- A property of polynomials with an application to Siegel's lemma
- An integer analogue of Carathéodory's theorem
- Carathéodory bounds for integer cones
- Combinatorics and commutative algebra.
- Decoding by Linear Programming
- Deterministic Approximation Algorithms for the Nearest Codeword Problem
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- scientific article; zbMATH DE number 3121715 (Why is no real title available?)
- 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 193022 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- scientific article; zbMATH DE number 2190625 (Why is no real title available?)
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- On factorization invariants and Hilbert functions
- On Siegel's lemma
- On the (co)girth of a connected matroid
- On the set of elasticities in numerical monoids
- Siegel's Lemma and sum-distinct sets
- Stable signal recovery from incomplete and inaccurate measurements
- The best constant in Siegel's Lemma
- The intractability of computing the minimum distance of a code
Cited in
(29)- The integrality number of an integer program
- Sparse representation of vectors in lattices and semigroups
- On sparse geometry of numbers
- Evasive properties of sparse graphs and some linear equations in primes
- Sparsity of integer solutions in the average case
- Factorization length distribution for affine semigroups. I: Numerical semigroups with three generators
- The support of integer optimal solutions
- Optimizing sparsity over lattices and semigroups
- On lattice width of lattice-free polyhedra and height of Hilbert bases
- The distributions of functions related to parametric integer optimization
- Distance-sparsity transference for vertices of corner polyhedra
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Augmented Hilbert series of numerical semigroups
- scientific article; zbMATH DE number 5038555 (Why is no real title available?)
- New Bounds for the Integer Carathéodory Rank
- Minkowski's successive minima in convex and discrete geometry
- Sparse approximation in lattices and semigroups
- Some asymptotic results on p-lengths of factorizations for numerical semigroups and arithmetical congruence monoids
- Dyadic linear programming and extensions
- 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
- On numerical semigroup elements and the \(\ell_0\) and \(\ell_{\infty}\) norms of their factorizations
- The support of bin packing is exponential
- A note on sparse solutions of sparse linear systems
This page was built for publication: Sparse Solutions of Linear Diophantine Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737776)
