On the column number and forbidden submatrices for $\Delta$-modular matrices
Joseph Paat, Ingo Stallknecht, Zach Walsh, Luze Xu

TL;DR
This paper investigates the structural properties of $ ext{Delta}$-modular matrices, establishing an upper bound on the number of nonzero, pairwise non-parallel columns in such matrices, which has implications for integer programming complexity.
Contribution
It provides the first polynomial-function-based upper bound on the column number of $ ext{Delta}$-modular matrices, advancing understanding of their structure.
Findings
Bound on nonzero, pairwise non-parallel columns in $ ext{Delta}$-modular matrices.
Introduction of a partial list of forbidden matrices for $ ext{Delta}$-modular matrices.
The bound is tight up to a polynomial factor in $ ext{Delta}$.
Abstract
An integer matrix is -modular if the determinant of each submatrix of has absolute value at most . The study of -modular matrices appears in the theory of integer programming, where an open conjecture is whether integer programs defined by -modular constraint matrices can be solved in polynomial time if is considered constant. The conjecture is only known to hold true when . In light of this conjecture, a natural question is to understand structural properties of -modular matrices. We consider the column number question -- how many nonzero, pairwise non-parallel columns can a rank- -modular matrix have? We prove that for each positive integer and sufficiently large integer , every rank- -modular matrix…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Advanced Algebra and Logic · Advanced Topology and Set Theory
