Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918166999859200 |
|---|---|
| author | Dadush, Daniel Eisenbrand, Friedrich Pinchasi, Rom Rothvoss, Thomas Singer, Neta |
| author_facet | Dadush, Daniel Eisenbrand, Friedrich Pinchasi, Rom Rothvoss, Thomas Singer, Neta |
| contents | For a real matrix $A \in \mathbb{R}^{d \times n}$ with non-collinear columns, we show that $n \leq O(d^4 κ_A)$ where $κ_A$ is the \emph{circuit imbalance measure} of $A$. The circuit imbalance measure $κ$ is a real analogue of $Δ$-modularity for integer matrices, satisfying $κ_A \leq Δ_A$ for integer $A$. The circuit imbalance measure has numerous applications in the context of linear programming (see Ekbatani, Natura and V{é}gh (2022) for a survey). Our result generalizes the $O(d^4 Δ_A)$ bound of Averkov and Schymura (2023) for integer matrices and provides the first polynomial bound holding for all parameter ranges on real matrices.
To derive our result, similar to the strategy of Geelen, Nelson and Walsh (2021) for $Δ$-modular matrices, we show that real representable matroids induced by $κ$-bounded matrices are minor closed and exclude a rank $2$ uniform matroid on $O(κ)$ elements as a minor (also known as a line of length $O(κ)$).
As our main technical contribution, we show that any simple rank $d$ complex representable matroid which excludes a line of length $l$ has at most $O(d^4 l)$ elements. This complements the tight bound of $(l-3)\binom{d}{2} + d$ for $l \geq 4$, of Geelen, Nelson and Walsh which holds when the rank $d$ is sufficiently large compared to $l$ (at least doubly exponential in $l$). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_20301 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure Dadush, Daniel Eisenbrand, Friedrich Pinchasi, Rom Rothvoss, Thomas Singer, Neta Discrete Mathematics Combinatorics For a real matrix $A \in \mathbb{R}^{d \times n}$ with non-collinear columns, we show that $n \leq O(d^4 κ_A)$ where $κ_A$ is the \emph{circuit imbalance measure} of $A$. The circuit imbalance measure $κ$ is a real analogue of $Δ$-modularity for integer matrices, satisfying $κ_A \leq Δ_A$ for integer $A$. The circuit imbalance measure has numerous applications in the context of linear programming (see Ekbatani, Natura and V{é}gh (2022) for a survey). Our result generalizes the $O(d^4 Δ_A)$ bound of Averkov and Schymura (2023) for integer matrices and provides the first polynomial bound holding for all parameter ranges on real matrices. To derive our result, similar to the strategy of Geelen, Nelson and Walsh (2021) for $Δ$-modular matrices, we show that real representable matroids induced by $κ$-bounded matrices are minor closed and exclude a rank $2$ uniform matroid on $O(κ)$ elements as a minor (also known as a line of length $O(κ)$). As our main technical contribution, we show that any simple rank $d$ complex representable matroid which excludes a line of length $l$ has at most $O(d^4 l)$ elements. This complements the tight bound of $(l-3)\binom{d}{2} + d$ for $l \geq 4$, of Geelen, Nelson and Walsh which holds when the rank $d$ is sufficiently large compared to $l$ (at least doubly exponential in $l$). |
| title | Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure |
| topic | Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2510.20301 |