Metraipolis › archive › dc_a1b077d8a9cc

A Twelve-Row Seed and a One-Row Extension for Five-Column Recursive-Line Zarankiewicz Numbers — arXiv:2609.33191

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33191
License (as archived)
CC0-1.0
Archived
2026-10-07T23:29:02.407Z
SHA-256 of the archived text
80846a9a8b482a43b81ef32e811881b93d26c9602110a0ed603016b52074700c
Stable URL of this page
https://metraipolis.com/documento/dc_a1b077d8a9cc

How to cite

A Twelve-Row Seed and a One-Row Extension for Five-Column Recursive-Line Zarankiewicz Numbers — arXiv:2609.33191 — arXiv (en), https://arxiv.org/abs/2609.33191 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a1b077d8a9cc (Metraipolis archive dc_a1b077d8a9cc, sha256 80846a9a8b482a43b81ef32e811881b93d26c9602110a0ed603016b52074700c)
BibTeX
@misc{dca1b077d8a9cc,
  title = {A Twelve-Row Seed and a One-Row Extension for Five-Column Recursive-Line Zarankiewicz Numbers — arXiv:2609.33191},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33191},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a1b077d8a9cc; sha256 80846a9a8b482a43b81ef32e811881b93d26c9602110a0ed603016b52074700c},
  year = {2026}
}

Archived text

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

We prove that the five-column recursive-line Zarankiewicz number satisfies $z_{RL}(m,5)=3m+5$ for every integer $m\ge 12$. The proof is based on an explicit $12\times5$ seed configuration combined with a recursive one-row extension scheme. The seed attains the five-column cell bound and contains no unoccupied cells. Two selected pairs in the seed are opened and replaced by parallel paths, ensuring that each inserted row increases the total number of augmented edges by three while preserving the required simple configuration. The main challenge lies in verifying the strengthened recursive-line condition ${\rm (RW3+)}$ uniformly across all extension lengths. To this end, we develop a distance-reducing rectangle lemma that transfers certified inner-product relations along extension paths, reducing relations between distant labels to those at smaller path distances. This confines the verification for arbitrarily long extensions to a finite collection of seed and interface certificates. The resulting construction successfully satisfies pair identification, preserves distinct selected-edge classes, and certifies the orthogonality of distinct edge representatives. Furthermore, combining this constructed lower bound with the parameter hierarchy yields $z_2(m,5)=z_{RL}(m,5)=3m+5$ throughout this range.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Spectral Theory (math.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.33191 — 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-07T23:08:10.797Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).