$2$-Modular Matrices
James Oxley, Zach Walsh

TL;DR
This paper investigates the maximum number of nonzero, pairwise non-parallel rows in rank-$r$ 2-modular matrices, extending classical results from unimodular matrices to a broader class.
Contribution
It establishes a new upper bound for the number of such rows in rank-$r$ 2-modular matrices for large $r$, generalizing Heller's 1957 result.
Findings
Maximum number of rows in rank-$r$ 2-modular matrices is ${r + 2 race 2} - 2$ for large $r$.
Extends classical unimodular matrix results to 2-modular matrices.
Provides insights into the structure of $oxed{ ext{2-modular matrices}}$.
Abstract
A rank- integer matrix is -modular if the determinant of each submatrix has absolute value at most . The class of -modular, or unimodular, matrices is of fundamental significance in both integer programming theory and matroid theory. A 1957 result of Heller shows that the maximum number of nonzero, pairwise non-parallel rows of a rank- unimodular matrix is . We prove that, for each sufficiently large integer , the maximum number of nonzero, pairwise non-parallel rows of a rank- -modular matrix is .
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
TopicsDigital Image Processing Techniques · graph theory and CDMA systems · Advanced Graph Theory Research
