Basis density of matroids with circumference at most four

We determine the asymptotically maximum number of bases of a rank-r matroid with no U(4,5)-minor, for every fixed r >= 4. Writing r = 3q + t, where 0 <= t <= 2, the maximum basis density is r! A_r/r^r, with A_(3q) = (9/2)^q, A_(3q+1) = (128/27)(9/2)^(q-1), and A_(3q+2) = 2(9/2)^q. In particular, the rank-four density is 4/9. For ranks congruent to one modulo three, the construction uses a connected rank-four book with its common point deleted. We also determine the fixed-rank leading term with error O_r(n^(r-1)) and the connected-matroid density. Three copies of AG(3,2) disprove a proposed finite extremal bound of van der Pol, Walsh and Wigal. The proof combines published small-circumference classifications with sharp weighted basis counting and optimization over component ranks. This is a preprint, not a peer-reviewed journal publication. The accompanying reproducibility archive contains LaTeX sources, standard-library Python verification code (Python 3.10+), exact-arithmetic output, and reproduction instructions. The first public release incorporates a correction to the construction lemma using minimal dependence; its main numerical conclusions are unchanged. See revision_notes.txt for details. AI-use disclosure: OpenAI Codex assisted argument exploration, literature searches, drafting and revision, verification-code generation, and internal checks, including internal AI reviews. The author is responsible for the manuscript. No specific funding or competing interests are declared.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-09
DOI
https://doi.org/10.5281/zenodo.23255892
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Basis density of matroids with circumference at most four

Yiming Liu
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Basis density of matroids with circumference at most four

Yiming Liu
preprint en

Abstract

We determine the asymptotically maximum number of bases of a rank-r matroid with no U(4,5)-minor, for every fixed r >= 4. Writing r = 3q + t, where 0 <= t <= 2, the maximum basis density is r! A_r/r^r, with A_(3q) = (9/2)^q, A_(3q+1) = (128/27)(9/2)^(q-1), and A_(3q+2) = 2(9/2)^q. In particular, the rank-four density is 4/9. For ranks congruent to one modulo three, the construction uses a connected rank-four book with its common point deleted. We also determine the fixed-rank leading term with error O_r(n^(r-1)) and the connected-matroid density. Three copies of AG(3,2) disprove a proposed finite extremal bound of van der Pol, Walsh and Wigal. The proof combines published small-circumference classifications with sharp weighted basis counting and optimization over component ranks. This is a preprint, not a peer-reviewed journal publication. The accompanying reproducibility archive contains LaTeX sources, standard-library Python verification code (Python 3.10+), exact-arithmetic output, and reproduction instructions. The first public release incorporates a correction to the construction lemma using minimal dependence; its main numerical conclusions are unchanged. See revision_notes.txt for details. AI-use disclosure: OpenAI Codex assisted argument exploration, literature searches, drafting and revision, verification-code generation, and internal checks, including internal AI reviews. The author is responsible for the manuscript. No specific funding or competing interests are declared.

Zenodo (CERN European Organization for Nuclear Research)
University of South China (CN)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.