On the maximal number of columns of a \(\Delta \)-modular integer matrix: bounds and computations
DOI10.1007/s10107-023-01964-2MaRDI QIDQ6589744
Gennadiy Averkov, Matthias Henze
Publication date: 20 August 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Extremal combinatorics (05D99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On linear systems with integral valued solutions
- Short cocircuits in binary matroids
- Subspaces with well-scaled frames
- Forbidden configurations, discrepancy and determinants
- Classification of triples of lattice polytopes with a given mixed volume
- On the maximal number of columns of a \(\varDelta \)-modular matrix
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants
- A strongly polynomial algorithm for bimodular integer linear programming
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Congruency-constrained TU problems beyond the bimodular case
This page was built for publication: On the maximal number of columns of a \(\Delta \)-modular integer matrix: bounds and computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589744)
