Search arXivSearch

arXiv · 2509.13463

The column number for 3-modular matrices

Abstract

An integer-valued matrix $\mathbf{A}$ is $Δ$-modular if each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix has determinant at most $Δ$ in absolute value. The column number problem is to determine the maximum number of pairwise non-parallel columns of a rank-$r$, $Δ$-modular matrix. Exact values for the column number are only known for $r \le 2$ or $Δ\le 2$. We prove that if $r$ is sufficiently large, then the maximum number of pairwise non-parallel columns of a rank-$r$, $3$-modular matrix is $\binom{r+1}{2} + 2(r-1)$. This settles a conjecture by Lee, Paat, Stallknecht, and Xu on the column number in the case $Δ= 3$. We complement this main result by showing that there are at least three $3$-modular matrices with pairwise non-isomorphic vector matroids that attain this upper bound. More generally, we show that if $r > Δ$, then the number of $Δ$-modular matrices with $\binom{r+1}{2} + (Δ-1)(r-1)$ pairwise non-parallel columns and pairwise non-isomorphic vector matroids is at least exponential in $\sqrtΔ$; previously only one matrix was known due to Lee et al.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph Paat, Zach Walsh, Luze Xu. 2025-09-16. The column number for 3-modular matrices. https://arxiv.org/abs/2509.13463

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO