Searcharxiv⌕ Search

arXiv · 2610.04448

The Second-Order Augmented Zarankiewicz Number

Abstract

The second-order Zarankiewicz number $z_2(m,n)$ and the biquadratic sum-of-squares rank $\mathrm{BSR}(m,n)$ are related by the unconditional hierarchy \[ \mathrm{BSR}(m,n)\ \ge\ z_2(m,n)\ \ge\ z_{SL}(m,n)\ \ge\ z_{RL}(m,n) \ \ge\ z_{wL}(m,n)\ \ge\ z(m,n). \] We introduce the \emph{second-order augmented Zarankiewicz number} $z_{2A}(m,n)$, obtained from $z_2(m,n)$ by deleting the requirement that the configuration be \emph{limited}, so that \[ \mathrm{BSR}(m,n)\ \ge\ z_{2A}(m,n)\ \ge\ z_2(m,n). \] Although the defining class is enlarged, $z_{2A}$ still obeys the universal cell bound of Löfberg and Qi, because that bound uses only the \(C_4\)-freeness of the one-edge graph. We prove \[ \mathrm{BSR}(4,4)\ \ge\ z_{2A}(4,4)\ =\ 11\ >\ 10\ =\ z_2(4,4) \ =\ z_{RL}(4,4), \] the first recorded separation between the second-order number and its augmented variant. This result also gives a better lower bound for $\mathrm{BSR}(4,4)$. The lower bound is witnessed by an explicit non-limited $4\times4$ configuration of displayed length $11$ whose recursive-line closure satisfies $(\mathrm{RW}3^+)$; the matching upper bound excludes $12$ by the universal cell bound together with an exact finite classification of the $161$ twelve-square configurations, and \(z_2(4,4)=z_{RL}(4,4)=10\) is the exact value of Xu and Yan.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Liqun Qi, Chunfeng Cui. 2026-10-03. The Second-Order Augmented Zarankiewicz Number. https://arxiv.org/abs/2610.04448

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Entropy and the growth rate of universal covering trees

This work studies the relation between two graph parameters, $ρ$ and $Λ$. For an undirected graph $G$, $ρ(G)$ is the growth rate of its universal covering tree, while $Λ(G)$ is a weighted geometric average of the vertex degree minus one, corresponding to the rate of entropy growth for the non-backtracking random walk (NBRW). It is well known that $ρ(G) \geq Λ(G)$ for all graphs, and that graphs with $ρ=Λ$ exhibit some special properties. In this work we derive an easy to check, necessary and sufficient condition for the equality to hold. Furthermore, we show that the variance of the number of random bits used by a length $\ell$ NBRW is $O(1)$ if $ρ= Λ$ and $Ω(\ell)$ if $ρ> Λ$. As a consequence we exhibit infinitely many non-trivial examples of graphs with $ρ= Λ$.

math.CO↗

Multivalued forbidden numbers of two-rowed configurations -- the missing cases

The present paper considers extremal combinatorics questions in the language of matrices. An $s$-matrix is a matrix with entries in $\{0,1,\ldots, s-1\}$. An $s$-matrix is simple if it has no repeated columns. A matrix $F$ is a configuration in a matrix $A$, denoted $F\prec A$, if it is a row/column permutation of a submatrix of $A$. $\text{Avoid}(m,s,F)$ is the set of $m$-rowed, simple $s$-matrices not containing a configuration of $F$ and $\text{forb}(m,s, F)=\max\{|A|\colon A \in \text{Avoid}(m,s,F)\}$. Dillon and Sali initiated the systematic study of $\text{forb}(m,s, F)$ for $2$-matrices $F$, and computed $\text{forb}(m,s, F)$ for all 2-rowed $F$ when $s>3$. In this paper we tackle the remaining cases when $s=3$. In particular, we determine the asymptotics of $\text{forb}(m,3,p\cdot K_2)-\text{forb}(m,3,p\cdot I_2)$ for $p>3$, where $K_2$ is the $2\times 4$ simple $2$-matrix and $I_2$ is the $2\times 2$ identity matrix, as well as the exact values of $\text{forb}(m,3,F)$ for many 2-rowed $2$-matrices $F$.

math.CO↗

Classical symmetric varieties and quiver representations

The parametrization of Borel orbits on classical symmetric varieties G/K is traditionally described via the combinatorics of clans, developed by Matsuki, Oshima, Wyser, and Yamamoto. We provide a quiver-theoretic reproof of the indexing sets for G = GL_n or Sp_{2n} and K a two-block Levi subgroup using Gabriel's Theorem. This method reveals an unexpected independence from algebraic closure: while orbit counts for most symmetric varieties are sensitive to the base field, our parametrizations remain valid over arbitrary fields for GL_n, and in characteristic not 2 for Sp_{2n}. We further reformulate these sets via matchings in corona graphs to derive new enumerative results, including the ultra log-concavity of orbit counts.

math.CO↗