Imagen de Portada

Automated conjecturing with \emph{TxGraffiti}

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Davila, Randy
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Another conjecture of TxGraffiti concerning zero forcing and domination in graphs
por: Davila, Randy R.
Publicado: (2024)

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

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

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

Lower bounds for the total (distance) $k$-domination number of a graph
por: Davila, Randy
Publicado: (2024)

An AI enhanced approach to the tree unimodality conjecture
por: Ramos, Eric, et al.
Publicado: (2025)

Estimating the stability number of a random graph using convolutional neural networks
por: Davila, Randy
Publicado: (2024)

Automated Discovery of Improved Constant Weight Binary Codes
por: Rosin, Christopher D.
Publicado: (2026)

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)

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

New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search
por: Bhan, Jay, et al.
Publicado: (2026)

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

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

Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
por: Caro, Yair, et al.
Publicado: (2024)

A Characterization of Claw-Free Graphs using Zero Forcing Invariants
por: Davila, Randy, et al.
Publicado: (2024)

Polymorphic Combinatorial Frameworks (PCF): Guiding the Design of Mathematically-Grounded, Adaptive AI Agents
por: Pearl, David, 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)

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

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

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

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

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

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

Independence, induced subgraphs, and domination in $K_{1,r}$-free graphs
por: Caro, Yair, et al.
Publicado: (2025)

Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design
por: Xia, Hai, et al.
Publicado: (2026)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
por: Stojanović, Vanja, et al.
Publicado: (2025)

Lifted Inference beyond First-Order Logic
por: Malhotra, Sagar, et al.
Publicado: (2023)

Toward TransfORmers: Revolutionizing the Solution of Mixed Integer Programs with Transformers
por: Cooper, Joshua F., et al.
Publicado: (2024)

Using Code Generation to Solve Open Instances of Combinatorial Design Problems
por: Rosin, Christopher D.
Publicado: (2025)

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

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

Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding
por: Wang, Shiyue, et al.
Publicado: (2025)

Machine Learning meets Algebraic Combinatorics: A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics
por: Chau, Herman, et al.
Publicado: (2025)

\emph{FoQuS}: A Forgetting-Quality Coreset Selection Framework for Automatic Modulation Recognition
por: Lu, Yao, et al.
Publicado: (2025)

TxRay: Agentic Postmortem of Live Blockchain Attacks
por: Wang, Ziyue, et al.
Publicado: (2026)

A $Δ$-evaluation function for column permutation problems
por: Lima, Júnior R., et al.
Publicado: (2024)

Ollivier-Ricci Curvature of Riemannian Manifolds and Directed Graphs with Applications to Graph Neural Networks
por: Wiesler, Eleanor
Publicado: (2026)

TxGemma: Efficient and Agentic LLMs for Therapeutics
por: Wang, Eric, et al.
Publicado: (2025)