PulseAugur
LIVE 06:27:16
tool · [1 source] ·
0
tool

LLM evolutionary search finds new bounds for Zarankiewicz numbers

Researchers have utilized an LLM-enhanced evolutionary algorithm called OpenEvolve to discover new bounds for Zarankiewicz numbers, which relate to the maximum edges in bipartite graphs without specific complete subgraphs. This approach successfully determined exact values for three Zarankiewicz numbers and established lower bounds for 41 others, including several close to existing upper bounds. The method proved to be cost-effective, with computations costing less than $30 per parameter combination, showcasing LLM-guided evolutionary search as an accessible tool for mathematical discovery. AI

Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →

IMPACT Demonstrates LLM-guided evolutionary search as a cost-effective tool for advancing mathematical research and combinatorial discovery.

RANK_REASON Academic paper detailing a new method for mathematical discovery using LLM-guided evolutionary search. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

COVERAGE [1]

  1. arXiv cs.AI TIER_1 · Jay Bhan, Nicole Nobili, Srinivasan Raghuraman, Patrick Langer ·

    New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search

    arXiv:2605.01120v1 Announce Type: new Abstract: The Zarankiewicz number $\textbf{Z}(m, n, s, t)$ is the maximum number of edges in a bipartite graph $G_{m, n}$ such that there is no complete $K_{s, t}$ bipartite subgraph. We determine for the first time the exact values of three …