A General Lower Bound for the Limited Augmented Zarankiewicz Number based upon Complete Graphs

Abstract

The limited augmented Zarankiewicz number zL(m,n) satisfies BSR(m,n) zL(m,n) z(m,n), where BSR(m,n) is the maximum SOS rank of m× n biquadratic forms and z(m,n) is the classical Zarankiewicz number. Our main result is a general lower bound for zL(m,n) based on the incidence graph of the complete graph K4t. For every integer t 1, let m = 4t2 and n = 4t. Then BSR(m,n) \;\; zL(m,n) \;\; 24t2 + 4t2 - 2t. Since z = 24t2 = Θ(t2), the gap satisfies zL - z 4t2 - 2t = Θ(t2) = Θ(m), i.e., it grows linearly in m. Moreover, zL - zz \;\; 4t216t2 - 4t \;\; 14 as t∞, so the gap is asymptotically at least 25\% of z -- a non-negligible constant fraction. For t=1 we obtain zL(6,4) 14, and we prove that this bound is tight, i.e., zL(6,4)=14. For t=2 and t=3 we obtain zL(28,8) 68 and zL(66,12) 162, respectively, improving previously known bounds. We also determine the exact values of zL(m,n) for 5×3 and 5×4: zL(5,3)=9 and zL(5,4)=12. These results serve as base cases for a lifting method that constructs admissible limited augmented graphs on (m+1)×(n+1) from optimal ones on m× n. Applying this method, we obtain new lower bounds: zL(6,3) 10 and zL(6,5) 17. For 5× 5 we establish a new lower bound zL(5,5) 15, improving the previously known bound. By a direct construction, we have zL(6,6) 20.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…