On the number of distinct rows of a matrix with bounded subdeterminants

DOI10.1137/17M1125728MaRDI QIDQ3174729zbMATHWikidataFDO

Authors Robert Weismantel, Rico Zenklusen, Christoph Glanzer

Publication date 18 July 2018

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

totally unimodular matricesbounded minorsHeller's bound

Mathematics Subject Classification ID

Integer programming (90C10) Matrices of integers (15B36) Extremal combinatorics (05D99)

Recommendations

• Forbidden configurations, discrepancy and determinants
• Rank two matrices with elements of norm 1
• 2-modular matrices
• On the maximal number of columns of a \(\varDelta \)-modular matrix
• Determinants of binary matrices achieve every integral value up to \(\Omega (2^n/n)\)

Cites work

• scientific article; zbMATH DE number 3133252 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 2053394 (Why is no real title available?)
• A combinatorial problem; stability and order for models and theories in infinitary languages
• A note on non-degenerate integer programs with small sub-determinants
• A strongly polynomial algorithm for bimodular integer linear programming
• Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
• Forbidden configurations, discrepancy and determinants
• Integer program with bimodular matrix
• On linear systems with integral valued solutions
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the density of families of sets
• Probability for statistics and machine learning. Fundamentals and advanced topics.
• Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
• Shattering news
• Short cocircuits in binary matroids
• Subspaces with well-scaled frames
• The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
• \(\epsilon\)-nets and simplex range queries

Cited in

(15)

• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
• On the maximal number of columns of a \(\Delta \)-modular integer matrix: bounds and computations
• On the recognition of \(\{a,b,c\}\)-modular matrices
• The integrality number of an integer program
• On the upper bounds of the minimum number of rows of disjunct matrices
• On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices
• Notes on \(\{a,b,c\}\)-modular matrices
• scientific article; zbMATH DE number 2039061 (Why is no real title available?)
• On lattice point counting in \(\varDelta\)-modular polyhedra
• Rank two matrices with elements of norm 1
• The Integrality Number of an Integer Program
• Advances on strictly \(\varDelta \)-modular IPs
• Excluding a line from complex-representable matroids
• On the maximal number of columns of a \(\varDelta \)-modular matrix
• 2-modular matrices

This page was built for publication: On the number of distinct rows of a matrix with bounded subdeterminants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174729)