Metraipolis › archive › dc_7da6deee23cb

Is the Signed Zarankiewicz Number the Same as the Recursive-line Zarankiewicz Number? — arXiv:2609.20071

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20071
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:09.355Z
SHA-256 of the archived text
0ab4106ba5c2744f13cb8a1550e9a5c5473276bf5a6cb9f646bd495f4004784a
Stable URL of this page
https://metraipolis.com/documento/dc_7da6deee23cb

How to cite

Is the Signed Zarankiewicz Number the Same as the Recursive-line Zarankiewicz Number? — arXiv:2609.20071 — arXiv (en), https://arxiv.org/abs/2609.20071 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7da6deee23cb (Metraipolis archive dc_7da6deee23cb, sha256 0ab4106ba5c2744f13cb8a1550e9a5c5473276bf5a6cb9f646bd495f4004784a)
BibTeX
@misc{dc7da6deee23cb,
  title = {Is the Signed Zarankiewicz Number the Same as the Recursive-line Zarankiewicz Number? — arXiv:2609.20071},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20071},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7da6deee23cb; sha256 0ab4106ba5c2744f13cb8a1550e9a5c5473276bf5a6cb9f646bd495f4004784a},
  year = {2026}
}

Archived text

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

Löfberg and Qi introduced the second order Zarankiewicz number \(z_2\), the recursive-line Zarankiewicz number \(z_{RL}\), and the signed Zarankiewicz number \(z_{SL}\) for doubly simple biquadratic forms. It was shown that \[ z_2(m,n)\ge z_{SL}(m,n)\ge z_{RL}(m,n) \] for all \(m\) and \(n\). However, there was no evidence that there exist particular \(m\) and \(n\) such that \(z_{SL}(m,n)>z_{RL}(m,n)\). The motivation for introducing \(z_{SL}\) was as follows: during the study of the exceptional case \(m=15\), \(n=6\), Löfberg and Qi showed that \[ z_2(15,6)=z_{SL}(15,6)=60, \] but the exact value of \(z_{RL}(15,6)\) was unknown then. In this paper we show that \[ z_{RL}(15,6)=60. \] This eliminates the motivation for introducing \(z_{SL}\). Whether \(z_{SL}(m,n)=z_{RL}(m,n)\) in general remains an open problem. Recently, Lebedev presented an explicit construction separating the augmented Zarankiewicz number \(z_A\) from the limited augmented Zarankiewicz number \(z_L\) at \(m=n=1893\). We hope that the separation problem for \(z_{SL}\) and \(z_{RL}\) can also be solved. We also present the exact values of \(z_{RL}(m,6)\) for \(6\le m\le 16\).

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