Metraipolis › archive › dc_ed14cc57f46f
Asymptotic equivalence and exact values for second-order Zarankiewicz numbers — arXiv:2610.05442
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.05442
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:52:01.320Z
- SHA-256 of the archived text
24f5c9eea7531cb7ef64b0ae2fcafed6f4aa08846e30b3105088cb1563101841- Stable URL of this page
https://metraipolis.com/documento/dc_ed14cc57f46f
How to cite
Asymptotic equivalence and exact values for second-order Zarankiewicz numbers — arXiv:2610.05442 — arXiv (en), https://arxiv.org/abs/2610.05442 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ed14cc57f46f (Metraipolis archive dc_ed14cc57f46f, sha256 24f5c9eea7531cb7ef64b0ae2fcafed6f4aa08846e30b3105088cb1563101841)
BibTeX
@misc{dced14cc57f46f,
title = {Asymptotic equivalence and exact values for second-order Zarankiewicz numbers — arXiv:2610.05442},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.05442},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ed14cc57f46f; sha256 24f5c9eea7531cb7ef64b0ae2fcafed6f4aa08846e30b3105088cb1563101841},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05442. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The recursive-line and signed Zarankiewicz numbers maximize the number of squares in augmentations of a maximum $C_4$-free base, subject to two sufficient irreducibility criteria. The count includes one square per base cell and one per selected pair of unused cells. We compare these parameters with the second-order number, which uses irreducibility itself. Every maximum $m\times n$ base admits a recursive-line augmentation with at least $mn/2-C\max(m,n)$ squares, for an absolute constant $C$. Combining this bound with a two-column extension of known fixed-width families, we show that all three parameters are asymptotically equivalent, uniformly as the larger dimension tends to infinity. For individual displays, a transfer graph shows that once the signed closure identifies every selected pair, the signed criterion is equivalent to irreducibility. We determine the second-order number for every six-column rectangle and give eventual exact formulas for all three numbers at widths seven, nine and eleven. We also prove signed and recursive-line equality at $8\times7$ and, together with earlier values, whenever the shorter side is at most six, except possibly at $14\times4$. The exact-value results are computer-assisted, using exhaustive enumeration, checked propositional refutations and symbolic certificates with a proved lifting argument for arbitrary lengths. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.05442 — 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-06T15:19:19.992Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).