The Shareshian-Wachs conjecture: elementary positivity of chromatic quasisymmetric functions of natural unit interval graphs
For a weakly increasing with , the natural unit interval graph on has edges with . Shareshian and Wachs defined , summed over proper colorings and weighted by the number of edges with , proved it symmetric and Schur-positive, and conjectured that its coefficients in the elementary basis lie in (and are palindromic and unimodal). At this is the Stanley-Stembridge conjecture via Guay-Paquet's reduction, proved by Hikita in 2024, whose formula gives positivity for each positive real but not coefficientwise. Does expand in the elementary basis with coefficients in for every natural unit interval graph?
- Result
- Proved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Algebraic combinatorics; chromatic symmetric functions
- Posed by
- John Shareshian and Michelle L. Wachs
- Year posed
- 2012
- Years open
- 14y
- Solved
- 2026-09-24
- Model
- Unreleased internal OpenAI model
- Vendor
- OpenAI
- Collaborators
- —
- Verification
- Lean-checked, statement unaudited
- Publication
- Announced
- Collection
- OpenAI math release (October 2026), version adc7f12
- Significance
- 33 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
Theorem 1.1: a terminating procedure assigns to each (permutations whose adjacent descents are edges) a partition with , where counts inversions supported on edges. Hence every elementary coefficient lies in and counts permutations; at this reproves the Stanley-Stembridge conjecture (Hikita; Griffin-Mellit-Romero-Weigl-Wen). Not shown: the unimodality part of the Shareshian-Wachs conjecture, an efficient description of (the procedure may be slow), or -positivity outside the natural unit interval class.
What the AI did
The release README says the results were produced by an unreleased internal OpenAI model with a fixed procedure, on average about three hours of ChatGPT Pro thinking compute per result, and that some outputs build on earlier model results. This result is not among the README's exceptions (the Hodge conjecture for CM abelian varieties, and the Re(s) > 11/12 zero-free region whose write-up was human-edited). The manuscripts are authored 'OpenAI' and name no human author. The family is a single manuscript, 'Elementary positivity of chromatic quasisymmetric functions' (September 24, 2026).
Verification
No independent mathematician has checked this yet. Checked here: Theorem 1.1 was read against the conjecture: it gives an explicit expansion , which is the elementary-positivity part; the unimodality part is not claimed. Lean: lean/ComparatorChallenges/ElementaryPositivity.json exists (a definition challenge, OAI.elementaryPositivityWitness) and its solution module OAI.Combinatorics.Chromatic.Main is present at the pinned commit; the challenge is not in the formalization catalogue (formalization.yaml). The statement file was read here: for every natural unit interval graph given by a monotone extensive , the witness assigns a partition to each permitted nondescent permutation so that, for every number of variables, the chromatic polynomial over Polynomial N (proper colorings weighted by ) equals the sum of . Holding for every finite gives the symmetric-function identity, so this states the headline. Not rebuilt here.