Cover Image

In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Davila, Randy, Brimkov, Boris, Pepper, Ryan
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Artificial Intelligence Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Throttling for metric dimension and its variants
by: Brimkov, Boris, et al.
Published: (2025)

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

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

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

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

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

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

Ten Squares Force an Overlap
by: Shallit, Jeffrey
Published: (2026)

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
by: Chen, Xinyue, et al.
Published: (2025)

The Parameterized Complexity of Computing the VC-Dimension
by: Foucaud, Florent, et al.
Published: (2025)

Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs
by: Sambaturu, Prathyush, et al.
Published: (2025)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Gathering Information about a Graph by Counting Walks from a Single Vertex
by: Fuhlbrück, Frank, et al.
Published: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
by: von Bergen, Hanno, et al.
Published: (2026)

On a Characterization of Spartan Graphs
by: Misra, Neeldhara, et al.
Published: (2025)

Excluding a rectangular grid
by: Rambaud, Clément
Published: (2025)

On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)

What is and is not inside a Cayley graph?
by: Knauer, Kolja, et al.
Published: (2025)

Delta-system method: a survey
by: Kupavskii, Andrey
Published: (2025)

On a recolouring version of Hadwiger's conjecture
by: Bonamy, Marthe, et al.
Published: (2021)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Computer-assisted graph theory: a survey
by: Jooken, Jorik
Published: (2025)

Every Poset has a Large Cut
by: Linial, Nati, et al.
Published: (2025)

Counting the Number of Domatic Partition of a Graph
by: Alikhani, Saeid, et al.
Published: (2024)

The complexity of computing the period and the exponent of a digraph
by: Kiefer, Stefan, et al.
Published: (2024)

Maximal number of subword occurrences in a word
by: Fang, Wenjie
Published: (2024)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

Excluding an apex-forest or a fan as quickly as possible
by: Claus, Quentin, et al.
Published: (2026)

Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

A polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2026)

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
by: Laddha, Aditi, et al.
Published: (2025)

A quasi-polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2025)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

Exact number of flips required to sort a burnt stack of pancakes
by: Jäger, Gerold, et al.
Published: (2026)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)