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

DOI10.1137/17M1125728zbMATH Open1393.05262WikidataQ129520671 ScholiaQ129520671MaRDI QIDQ3174729FDOQ3174729

Rico Zenklusen, Christoph Glanzer, Robert Weismantel

Publication date: 18 July 2018

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

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)\)

zbMATH Keywords

totally unimodular matricesbounded minorsHeller's bound

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• Notes on \(\{a,b,c\}\)-modular matrices
• The integrality number of an integer program
• On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices
• Advances on strictly \(\varDelta \)-modular IPs
• 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
• Title not available (Why is that?)
• On lattice point counting in \(\varDelta\)-modular polyhedra
• The Integrality Number of an Integer Program
• On the upper bounds of the minimum number of rows of disjunct matrices
• 2-Modular Matrices
• On the maximal number of columns of a \(\varDelta \)-modular matrix
• On the recognition of \(\{a,b,c\}\)-modular matrices
• Excluding a line from complex-representable matroids

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)