Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.20019

How to Use Deep Learning to Identify Sufficient Conditions: A Case Study on Stanley's $e$-Positivity

Farid Aliniaeifard·Shu Xiao Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

In a study, published in Nature, researchers from DeepMind and mathematicians demonstrated a general framework using machine learning to make conjectures in pure mathematics. Here, we build upon this framework to develop a method for identifying sufficient conditions that imply a given mathematical statement. As a demonstration, we apply this process to Stanley's problem of $e$-positivity of graphs, one of the problems that has been at the center of algebraic combinatorics for the past three decades. Guided by AI, we rediscover that one sufficient condition for a graph to be $e$-positive is that it is co-triangle-free. Based on Saliency Map analysis, we suggest that the classification of $e$-positive graphs is more related to continuous graph invariants rather than the discrete ones, which we support it with three conjectures. Furthermore, we show that the claw-free and claw-contractible-free graphs with 10 and 11 vertices are $e$-positive, resolving a conjecture by Dahlberg, Foley, and van Willigenburg.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Farid Aliniaeifard, Shu Xiao Li. 2026-05-05. How to Use Deep Learning to Identify Sufficient Conditions: A Case Study on Stanley's $e$-Positivity. https://arxiv.org/abs/2511.20019

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗