Metraipolis › archive › dc_69af5ff09101

Exact Values, Extremal Classifications, and Sum-of-Squares Reductions for Second-Order Zarankiewicz Numbers — arXiv:2609.18429

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18429
License (as archived)
CC0-1.0
Archived
2026-10-15T16:13:07.065Z
SHA-256 of the archived text
493b729f1eed27a4cd8ce05f5b6a6ebf492fce63c32efc6b99c975ce774ce0ec
Stable URL of this page
https://metraipolis.com/documento/dc_69af5ff09101

How to cite

Exact Values, Extremal Classifications, and Sum-of-Squares Reductions for Second-Order Zarankiewicz Numbers — arXiv:2609.18429 — arXiv (en), https://arxiv.org/abs/2609.18429 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_69af5ff09101 (Metraipolis archive dc_69af5ff09101, sha256 493b729f1eed27a4cd8ce05f5b6a6ebf492fce63c32efc6b99c975ce774ce0ec)
BibTeX
@misc{dc69af5ff09101,
  title = {Exact Values, Extremal Classifications, and Sum-of-Squares Reductions for Second-Order Zarankiewicz Numbers — arXiv:2609.18429},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18429},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_69af5ff09101; sha256 493b729f1eed27a4cd8ce05f5b6a6ebf492fce63c32efc6b99c975ce774ce0ec},
  year = {2026}
}

Archived text

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

There is a natural connection between the SOS rank problem for bi-quadratic forms and the Zarankiewicz extremal problem for C4-free bipartite graphs. The classical Zarankiewicz number z(m,n) controls the bipartite skeleton associated with monomial squares. Allowing two cells to form a single bilinear square leads to augmented Zarankiewicz configurations and the second-order Zarankiewicz number z2(m,n). Unlike zRL and zSL, defined through recursive sufficient conditions, z2 maximizes over all irreducible displayed SOS decompositions without imposing (RW 3+). Hence, to prove z2(m,n)<=R, one must prove that every simple limited configuration with more displayed squares is reducible; failure of a sufficient condition cannot serve as a counterargument. We prove z2(4,4)=10, z2(7,4)=19, z2(8,4)=21, z2(5,5)=17, and obtain z2=zSL=zRL in all these cases. The extremal irreducible 6x4 configurations with 16 displayed squares form a single isomorphism class under row and column relabeling, whereas the extremal irreducible 7x4 configurations with 19 displayed squares form exactly three isomorphism classes. The four-column results form a structural chain: classify lower-order extremal configurations first, then use hereditary irreducibility under deletion of complete squares to constrain the next order. Finite exhaustive steps use candidate pruning, a necessary compatibility graph, clique enumeration, and orbit reduction, with a verifiable reducibility or irreducibility proof for each remaining orbit. For 5x5, there are two ordinary extremal skeletons; finite exclusion leaves only two highly symmetric 18-square candidates. They define the same ten-square polynomial, which admits an explicit nine-square representation, yielding the upper bound for z2(5,5).

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.18429 — 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-15T15:38:58.236Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).