arXiv (OAI Expanded)
open access
Recursive-Line Zarankiewicz Numbers with Four Columns
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 o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Twelve-Row Seed and a One-Row Extension for Five-Column Recursive-Line Zarankiewicz Numbers#1117903
- Rationality and Quasipolynomiality of Restricted Rectangle Partitions#1071108
- Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization#1011604
- No-$(k+1)$-in-line problem for large constant $k$#1108958
- The quotient problem for linear recurrence sequences#1129242
Record · ID 1083231
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive