Imagen de Portada

An AI enhanced approach to the tree unimodality conjecture

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ramos, Eric, Sun, Sunny
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Artificial Intelligence Discrete Mathematics Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond
por: Fujita, Takaaki, et al.
Publicado: (2024)

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

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

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
por: Bressan, Marco, et al.
Publicado: (2025)

Maxout Polytopes
por: Balakin, Andrei, et al.
Publicado: (2025)

On the Architectural Complexity of Neural Networks
por: Cooper, Nicholas J., et al.
Publicado: (2026)

Bounds on the price of feedback for mistake-bounded online learning
por: Geneson, Jesse, et al.
Publicado: (2024)

Graphons of Line Graphs
por: Kandanaarachchi, Sevvandi, et al.
Publicado: (2024)

Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees
por: Alston, Brandon, et al.
Publicado: (2024)

Plum: Prompt Learning using Metaheuristic
por: Pan, Rui, et al.
Publicado: (2023)

Toward Vu's conjecture
por: Bradshaw, Peter, et al.
Publicado: (2025)

An analogue of Reed's conjecture for digraphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2024)

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

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
por: Yu, Shanshan, et al.
Publicado: (2026)

Disproving two conjectures on the Hamiltonicity of Venn diagrams
por: Brenner, Sofia, et al.
Publicado: (2025)

Extension of the Gyárfás-Sumner conjecture to signed graphs
por: Aubian, Guillaume, et al.
Publicado: (2025)

Balanced-chromatic number and Hadwiger-like conjectures
por: Jiménez, Andrea, et al.
Publicado: (2023)

The 1/3-conjectures for domination in cubic graphs
por: Dorbec, Paul, et al.
Publicado: (2024)

Soft-ECM: An extension of Evidential C-Means for complex data
por: Soubeiga, Armel, et al.
Publicado: (2025)

Gödel Test: Can Large Language Models Solve Easy Conjectures?
por: Feldman, Moran, et al.
Publicado: (2025)

Learning with the $p$-adics
por: Martins, André F. T.
Publicado: (2025)

Accumulator-Aware Post-Training Quantization for Large Language Models
por: Colbert, Ian, et al.
Publicado: (2024)

A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization
por: Sanokowski, Sebastian, et al.
Publicado: (2024)

ReLU Networks for Exact Generation of Similar Graphs
por: Ghafoor, Mamoona, et al.
Publicado: (2026)

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
por: Mehrabian, Abbas, et al.
Publicado: (2023)

Transition Graph Properties of Target Class Classification
por: Aslanyan, Levon, et al.
Publicado: (2024)

Neural Lattice Reduction: A Self-Supervised Geometric Deep Learning Approach
por: Marchetti, Giovanni Luca, et al.
Publicado: (2023)

Structural perspective on constraint-based learning of Markov networks
por: Korhonen, Tuukka, et al.
Publicado: (2024)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
por: Dailly, Antoine, et al.
Publicado: (2018)

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

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

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

Progress towards the two-thirds conjecture on locating-total dominating sets
por: Chakraborty, Dipayan, et al.
Publicado: (2022)

How to see the forest for the trees
por: Bérczi-Kovács, Erika, et al.
Publicado: (2025)

Labeling and folding multi-labeled trees
por: Moulton, Vincent, et al.
Publicado: (2025)

Computational complexity of covering regular trees
por: Bok, Jan, et al.
Publicado: (2025)

Conflict-free chromatic index of trees
por: Guo, Shanshan, et al.
Publicado: (2024)

A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
por: Sun, Yali, et al.
Publicado: (2024)