AI Research

    New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search

    LLM-powered evolutionary search breaks new ground in extremal graph theory for under thirty dollars.

    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 Zarankiewicz numbers: $\textbf{Z}(11, 21, 3, 3)=...

    AC

    ArXiv CS.AI

    Source

    2 min
    AI Analysis

    Generated insight by OnAirToday AI

    This research demonstrates that LLMs can function as creative engines for mathematical discovery by iteratively refining algorithms through evolutionary search. The low computational cost highlights a new paradigm where accessible AI tools effectively solve long-standing problems in extremal combinatorics.

    Powered by AI • Not a substitute for human analysisMore Insights →
    Read the full story at ArXiv CS.AI →
    Share
    Filed under:AI Research

    Comments

    Keep comments relevant and respectful. No links, advertising, self-promotion, or spam.

    0/1000