Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.20019 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917459843350528 |
|---|---|
| author | Aliniaeifard, Farid Li, Shu Xiao |
| author_facet | Aliniaeifard, Farid Li, Shu Xiao |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_20019 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | How to Use Deep Learning to Identify Sufficient Conditions: A Case Study on Stanley's $e$-Positivity Aliniaeifard, Farid Li, Shu Xiao Combinatorics 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. |
| title | How to Use Deep Learning to Identify Sufficient Conditions: A Case Study on Stanley's $e$-Positivity |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2511.20019 |