Metraipolis › archive › dc_85bbe41fdea7

Recursive-Line Zarankiewicz Numbers with Four Columns — arXiv:2609.11093

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11093
License (as archived)
CC0-1.0
Archived
2026-10-16T06:13:48.581Z
SHA-256 of the archived text
6a3cbb4fa573135b839ac22ca46a8cc2297211eacd4a83a75a2737da6f2b1ddc
Stable URL of this page
https://metraipolis.com/documento/dc_85bbe41fdea7

How to cite

Recursive-Line Zarankiewicz Numbers with Four Columns — arXiv:2609.11093 — arXiv (en), https://arxiv.org/abs/2609.11093 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_85bbe41fdea7 (Metraipolis archive dc_85bbe41fdea7, sha256 6a3cbb4fa573135b839ac22ca46a8cc2297211eacd4a83a75a2737da6f2b1ddc)
BibTeX
@misc{dc85bbe41fdea7,
  title = {Recursive-Line Zarankiewicz Numbers with Four Columns — arXiv:2609.11093},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11093},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_85bbe41fdea7; sha256 6a3cbb4fa573135b839ac22ca46a8cc2297211eacd4a83a75a2737da6f2b1ddc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11093. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The recursive-line Zarankiewicz number maximizes the number of squares in a structured irreducible sum-of-squares representation encoded by an augmentation of an extremal $C_4$-free bipartite graph. We determine its four-column behavior under the strengthened recursive definition in the manuscript of Löfberg and Qi dated 9 September 2026. Combining AI-assisted discovery with exact certificate verification and finite exclusion computations, we determine eighteen of the nineteen values for $2\le m\le20$ and isolate the only unresolved case to $37\le\zr(14,4)\le38$. More significantly, we prove the first eventual exact formula in the four-column setting: \[ \zr(m,4)=\floor{\frac{5m+6}{2}}\qquad(m\ge15). \] The upper bound follows from the classical identity $z(m,4)=m+6$ and a sharp cell count. For the matching lower bound, we construct a two-row extension chain from an explicit $20\times4$ seed and derive the odd orders by a fixed deletion. Analytic propagation, together with two independently audited symbolic certificate tables, proves the construction for arbitrary chain length rather than merely for a finite computational range. Thus every extremal configuration has no holes when $m$ is even and exactly one hole when $m$ is odd, and the same exact formula holds for the second-order number $z_2(m,4)$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.11093 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:59:08.297Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).