Imagen de Portada

New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bhan, Jay, Nobili, Nicole, Langer, Patrick
Formato:	Preprint
Publicado:	2026
Materias:	Artificial Intelligence Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Reinforced Generation of Combinatorial Structures: Ramsey Numbers
por: Nagda, Ansh, et al.
Publicado: (2026)

A General Lower Bound for the Limited Augmented Zarankiewicz Number based upon Complete Graphs
por: Qi, Liqun, et al.
Publicado: (2026)

On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
por: Chalermsook, Parinya, et al.
Publicado: (2025)

The Packing Chromatic Number of the Infinite Square Grid is 15
por: Subercaseaux, Bernardo, et al.
Publicado: (2023)

Ramsey numbers and the Zarankiewicz problem
por: Conlon, David, et al.
Publicado: (2023)

BEAM: Bi-level Memory-adaptive Algorithmic Evolution for LLM-Powered Heuristic Design
por: Xiang, Chuyang, et al.
Publicado: (2026)

A Computational Study of Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs
por: Yi, Xu, et al.
Publicado: (2026)

Graph Neural Networks vs Convolutional Neural Networks for Graph Domination Number Prediction
por: Davila, Randy, et al.
Publicado: (2025)

Factorization norms and Zarankiewicz problems
por: Tomon, István
Publicado: (2025)

Zarankiewicz's problem via $ε$-t-nets
por: Keller, Chaya, et al.
Publicado: (2023)

Tight bounds towards Zarankiewicz problem in hypergraph
por: Gao, Guorong, et al.
Publicado: (2025)

Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems
por: Rosin, Christopher D.
Publicado: (2025)

The Zarankiewicz problem on tripartite graphs
por: Di Braccio, Francesco, et al.
Publicado: (2024)

A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes
por: Chao, Ting-Wei, et al.
Publicado: (2026)

Unbalanced Zarankiewicz problem for bipartite subdivisions with applications to incidence geometry
por: Ködmön, Lili, et al.
Publicado: (2024)

Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
por: Przybocki, Benjamin, et al.
Publicado: (2026)

Artificial intelligence and machine learning generated conjectures with TxGraffiti
por: Davila, Randy
Publicado: (2024)

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
por: Jha, Piyush, et al.
Publicado: (2024)

Tangles: a structural approach to artificial intelligence in the empirical sciences (Part I)
por: Diestel, Reinhard
Publicado: (2020)

Automated conjecturing with \emph{TxGraffiti}
por: Davila, Randy
Publicado: (2024)

On CNF formulas irredundant with respect to unit clause propagation
por: Savický, Petr
Publicado: (2023)

The \emph{Optimist}: Towards Fully Automated Graph Theory Research
por: Davila, Randy
Publicado: (2024)

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
por: Nagda, Ansh, et al.
Publicado: (2025)

The Zarankiewicz Problem for Polygon Visibility Graphs
por: Ackerman, Eyal, et al.
Publicado: (2025)

Multilevel polynomial partitioning and semialgebraic hypergraphs: regularity, Turán, and Zarankiewicz results
por: Tidor, Jonathan, et al.
Publicado: (2024)

Code Evolution for Control: Synthesizing Policies via LLM-Driven Evolutionary Search
por: Guo, Ping, et al.
Publicado: (2026)

New Bounds on the Anti-Ramsey Number of Independent Triangles
por: Lu, Hongliang, et al.
Publicado: (2025)

On the global linear Zarankiewicz problem
por: Eleftheriou, Pantelis E., et al.
Publicado: (2025)

Three-Edges and the SOS Rank of Biquadratic Forms: Extending the Augmented Zarankiewicz Framework
por: Qi, Liqun, et al.
Publicado: (2026)

A survey of Zarankiewicz problems in geometry
por: Smorodinsky, Shakhar
Publicado: (2024)

Polymorphic Combinatorial Frameworks (PCF): Guiding the Design of Mathematically-Grounded, Adaptive AI Agents
por: Pearl, David, et al.
Publicado: (2025)

SAT Requires Exhaustive Search
por: Xu, Ke, et al.
Publicado: (2023)

Improved upper bounds on Zarankiewicz numbers
por: Davies, Sara, et al.
Publicado: (2024)

Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the Erdős Problems
por: Feng, Tony, et al.
Publicado: (2026)

Complement Submodular Information Measures for Balanced and Robust Data Selection
por: Iyer, Rishabh
Publicado: (2026)

In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
por: Davila, Randy, et al.
Publicado: (2025)

Adaptation and Fine-tuning with TabPFN for Travelling Salesman Problem
por: Vu, Nguyen Gia Hien, et al.
Publicado: (2025)

Exact MAP inference in general higher-order graphical models using linear programming
por: Bechar, Ikhlef
Publicado: (2017)

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
por: Du, Alina, et al.
Publicado: (2026)

On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects
por: Chan, Timothy M., et al.
Publicado: (2024)