惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Vulnerabilities – Threatpost
大猫的无限游戏
大猫的无限游戏
M
MIT News - Artificial intelligence
IT之家
IT之家
B
Blog
博客园 - 【当耐特】
H
Hackread – Cybersecurity News, Data Breaches, AI and More
AI
AI
S
SegmentFault 最新的问题
N
News | PayPal Newsroom
人人都是产品经理
人人都是产品经理
I
InfoQ
GbyAI
GbyAI
WordPress大学
WordPress大学
Hugging Face - Blog
Hugging Face - Blog
D
DataBreaches.Net
Google DeepMind News
Google DeepMind News
L
LINUX DO - 最新话题
爱范儿
爱范儿
博客园 - 叶小钗
雷峰网
雷峰网
腾讯CDC
Recent Announcements
Recent Announcements
F
Fortinet All Blogs
U
Unit 42
C
CERT Recently Published Vulnerability Notes
S
Security Archives - TechRepublic
Cyberwarzone
Cyberwarzone
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
K
KPMG report finds enterprise disconnect between AI and its ROI | CIO
H
Heimdal Security Blog
A
Arctic Wolf
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
Google DeepMind News
Google DeepMind News
www.infosecurity-magazine.com
www.infosecurity-magazine.com
Google Online Security Blog
Google Online Security Blog
T
The Blog of Author Tim Ferriss
T
Tailwind CSS Blog
美团技术团队
N
Netflix TechBlog - Medium
Last Week in AI
Last Week in AI
T
The Exploit Database - CXSecurity.com
Scott Helme
Scott Helme
S
Security @ Cisco Blogs
Apple Machine Learning Research
Apple Machine Learning Research
Y
Y Combinator Blog
小众软件
小众软件
Jina AI
Jina AI
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC

math updates on arXiv.org

Any-Dimensional Invariant Universality Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Instance-Optimal Estimation with Multiple LLM Judges on a Budget Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Non-normal spectral signatures of instability in neural network training dynamics Is Dimensionality a Barrier for Retrieval Models? Optimization of randomized neural networks for transfer operator approximation Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Training-Free Looped Transformers Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Entropy Equivalence Testing Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Asymmetric Scaling Laws from Sparse Features Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Efficient Gradient Estimation for Parameterized Quantum Systems with Lie Algebraic Symmetries LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Linear Regression with Unknown Truncation Beyond Gaussian Features Training-Free Rate-Distortion-Perception Traversal With Diffusion Learning Decision-Sufficient Representations for Linear Optimization Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses Every Minimal Counterexample to the Erdős-Gyárfás Conjecture is Predominantly Cubic Prabhakar function and unified fractional kinetic equation in bicomplex space Every signed planar graph is $5$-choosable: A short proof and refinements A Comprehensive Study of Clique Graphs and Clique Regular Graphs Mathematical Foundations for Peer-to-Peer Lattice Computation Computing Gamma(p/q) with Beta function values Flows on Graded Manifolds Optimal embedding dimension in the Nash--Tognoli theorem Generalized Stochastic Approximation of the Log-Likelihood Ratio for Robust Sequential Change-Point Detection An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit Sharp Bohr-Type inequalities for certain classes of close-to-convex functions An Axiomatic Theory of Tie-Breaking: Impossibility, Characterization, and Decomposition Invariants of real affine varieties based on their complexifications The Geometry of Cooperative Game Solutions: Stratified Egalitarian Shapley Values Topological symmetric and braid homologies Reconstructibility of Pitch Class Graphs and the Z-relation Finite groups with high commuting probability for Sylow subgroups On Reed-Muller subcodes, Grassmannian partitions and sum-free functions Concise and elegant proofs of three formulas for complete Bell polynomials Performance Bounds for Rollout Policies in Stochastic Shortest Path Problems Real 2-blocks in quasi-simple groups Maximal subalgebras of the Lie algebra $W_n(\mathbb{K})$ Cohomogeneity-One Ruled Hypersurfaces in $\mathbb{CP}^2$ and $\mathbb{C}H^2$ Global analysis of the Kuramoto flow Cartier algebras through the lens of $p$-families Positivity in the context of Hodge modules and Higgs bundles on Deligne-Mumford stacks Symplectic lattice counting and zeta functions of higher Heisenberg groups A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage A secondary pairing between K-theory and K-homology, relative eta invariants, and zeta maps Detecting and Correcting Sample-by-Sample Scale Distortion in RNA Sequencing Data Star-Shaped Integral Cartan-Type Matrices and an Egyptian-Fraction Classification of Affine Weighted Trees The Poisson Tail Conjecture for Primes in Short Intervals Polylogarithmic Full-Chord Buffon Discrepancy Extremum seeking with exponential convergence via high-order Lie bracket approximations Sets of large values of polynomial multi-correlation functions Reflections and Sheafifications in Algebraic and Topological Categories On the final-state problem for the 1D cubic NLS Mode-Shape Expansion Using Physics-Constrained Gaussian Process Regression Isotropic Meta Kazhdan-Lusztig Combinatorics II: Isomorphism to the generalised Khovanov arc algebra Improved Torn Paper Coding via Local Alignment Discrete Pauli pairs Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Anytime Training with Schedule-Free Spectral Optimization The General Theory of Localization Methods SPHERICAL KV: Angle-Domain Attention and Rate-Distortion Retention for Efficient Long-Context Inference Program Evaluation with Remotely Sensed Outcomes PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees On Stability and Decomposition of Sample Quantiles under Heavy-Tailed Distributions Democratizing Large-Scale Re-Optimization with LLM-Guided Model Patches Symmetry-Compatible Principle for Optimizer Design: Embeddings, LM Heads, SwiGLU MLPs, and MoE Routers Stochastic Non-Smooth Convex Optimization with Unbounded Gradients PyCSP3-Scheduling: A Scheduling Extension for PyCSP3 Strategic PAC Learnability via Geometric Definability Proximal-Based Generative Modeling for Bayesian Inverse Problems NOVA: Fundamental Limits of Knowledge Discovery Through AI TopoGeoScore: A Self-Supervised Source-Only Geometric Framework for OOD Checkpoint Selection Omni-scale Learning-based Sequential Decision Framework for Order Fulfillment of Tote-handling Robotic Systems Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Normalizing Flows on Quotient Manifolds via Boundary Quotients Towards an Inferentialist Account of Information Through Proof-theoretic Semantics Beyond Continuity: Simulation-free Reconstruction of Discrete Branching Dynamics from Single-cell Snapshots A Unified Fractional Regularization Framework for Sparse Recovery Inference of Online Newton Methods with Nesterov's Accelerated Sketching Deep Learning of Solver-Aware Turbulence Closures from Nudged LES Dynamics Information bottleneck for learning the phase space of dynamics from high-dimensional experimental data QED: An Open-Source Multi-Agent System for Generating Mathematical Proofs on Open Problems Adaptive Learning via Off-Model Training and Importance Sampling for Fully Non-Markovian Optimal Stochastic Control. Complete version ArcMark: Distortion-Free Multi-Byte LLM Watermark via Optimal Transport Feature Learning Dynamics in Infinite-Depth Neural Networks TelecomTS: A Multi-Modal Observability Dataset for Time Series and Language Analysis
A General Lower Bound for the Limited Augmented Zarankiewicz Number based upon Complete Graphs
[Submitted on 5 Apr 2026 (v1), last revised 12 Jun 2026 (this ve · 2026-06-15 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract: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} = \Theta(t^2)$, the gap satisfies $z_L - z \ge 4t^2 - 2t = \Theta(t^2) = \Theta(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$.

Submission history

From: Liqun Qi [view email]
[v1] Sun, 5 Apr 2026 13:17:55 UTC (15 KB)
[v2] Mon, 13 Apr 2026 09:16:49 UTC (20 KB)
[v3] Wed, 15 Apr 2026 11:31:03 UTC (17 KB)
[v4] Mon, 4 May 2026 12:26:30 UTC (18 KB)
[v5] Fri, 12 Jun 2026 03:06:27 UTC (23 KB)