基于完全图的有限增广Zarankiewicz数的一般下界
A General Lower Bound for the Limited Augmented Zarankiewicz Number based upon Complete Graphs
AI总结:
基于完全图K_{4t}的关联图,给出有限增广Zarankiewicz数z_L(m,n)的一般下界,证明其与经典Zarankiewicz数z的差距至少为25%,并确定若干小参数下的精确值。
摘要:
有限增广Zarankiewicz数$z_L(m,n)$满足$\operatorname{BSR}(m,n)\ge z_L(m,n)\ge z(m,n)$,其中$\operatorname{BSR}(m,n)$是$m\times n$双二次型的最大SOS秩,$z(m,n)$是经典Zarankiewicz数。我们的主要结果是基于完全图$K_{4t}$的关联图给出的$z_L(m,n)$的一般下界。对每个整数$t\ge 1$,令$m = \binom{4t}{2}$且$n = 4t$。则$$ \operatorname{BSR}(m,n) \;\ge\; z_L(m,n) \;\ge\; 2\binom{4t}{2} + 4t^2 - 2t. $$由于$z = 2\binom{4t}{2} = \Theta(t^2)$,差距满足$z_L - z \ge 4t^2 - 2t = \Theta(t^2) = \Theta(m)$,即它随$m$线性增长。此外,$$ \frac{z_L - z}{z} \;\ge\; \frac{4t^2}{16t^2 - 4t} \;\longrightarrow\; \frac{1}{4} \quad \text{当 } t\to\infty, $$因此差距渐近地至少为$z$的$25\%$——一个不可忽略的常数比例。对于$t=1$,我们得到$z_L(6,4)\ge 14$,并证明该界是紧的,即$z_L(6,4)=14$。对于$t=2$和$t=3$,我们分别得到$z_L(28,8)\ge 68$和$z_L(66,12)\ge 162$,改进了先前已知的界。我们还确定了$5\times3$和$5\times4$的$z_L(m,n)$精确值:$z_L(5,3)=9$和$z_L(5,4)=12$。这些结果作为\textit{提升方法}的基础情形,该方法从$m\times n$上的最优图构造$(m+1)\times(n+1)$上的容许有限增广图。应用此方法,我们得到新的下界:$z_L(6,3)\ge 10$和$z_L(6,5)\ge 17$。对于$5\times 5$,我们建立了新的下界$z_L(5,5)\ge 15$,改进了先前已知的界。通过直接构造,我们有$z_L(6,6)\ge 20$。
英文摘要:
The limited augmented Zarankiewicz number $z_L(m,n)$ satisfies $\operatorname{BSR}(m,n)\ge z_L(m,n)\ge z(m,n)$, where $\operatorname{BSR}(m,n)$ is the maximum SOS rank of $m\times n$ biquadratic forms and $z(m,n)$ is the classical Zarankiewicz number. Our main result is a general lower bound for $z_L(m,n)$ based on the incidence graph of the complete graph $K_{4t}$. For every integer $t\ge 1$, let $m = \binom{4t}{2}$ and $n = 4t$. Then $$ \operatorname{BSR}(m,n) \;\ge\; z_L(m,n) \;\ge\; 2\binom{4t}{2} + 4t^2 - 2t. $$ Since $z = 2\binom{4t}{2} = Θ(t^2)$, the gap satisfies $z_L - z \ge 4t^2 - 2t = Θ(t^2) = Θ(m)$, i.e., it grows linearly in $m$. Moreover, $$ \frac{z_L - z}{z} \;\ge\; \frac{4t^2}{16t^2 - 4t} \;\longrightarrow\; \frac{1}{4} \quad \text{as } t\to\infty, $$ so the gap is asymptotically at least $25\%$ of $z$ -- a non-negligible constant fraction. For $t=1$ we obtain $z_L(6,4)\ge 14$, and we prove that this bound is tight, i.e., $z_L(6,4)=14$. For $t=2$ and $t=3$ we obtain $z_L(28,8)\ge 68$ and $z_L(66,12)\ge 162$, respectively, improving previously known bounds. We also determine the exact values of $z_L(m,n)$ for $5\times3$ and $5\times4$: $z_L(5,3)=9$ and $z_L(5,4)=12$. These results serve as base cases for a \emph{lifting method} that constructs admissible limited augmented graphs on $(m+1)\times(n+1)$ from optimal ones on $m\times n$. Applying this method, we obtain new lower bounds: $z_L(6,3)\ge 10$ and $z_L(6,5)\ge 17$. For $5\times 5$ we establish a new lower bound $z_L(5,5)\ge 15$, improving the previously known bound. By a direct construction, we have $z_L(6,6)\ge 20$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。