combinatorics / Newton polytopes
If a chromatic symmetric function is Schur positive, must every finite-variable specialization $X_G(x_1, \dots, x_k)$ have a saturated Newton polytope? A $12$-vertex bipartite graph realizes weights $(6,6,0)$ and $(8,2,2)$ but omits their midpoint $(7,4,1)$.
Temporal state
No reconciled state yet.
Append-only history
If a chromatic symmetric function is Schur positive, must every finite-variable specialization $X_G(x_1, \dots, x_k)$ have a saturated Newton polytope? A $12$-vertex bipartite graph realizes weights $(6,6,0)$ and $(8,2,2)$ but omits their midpoint $(7,4,1)$.
Research memory
If a chromatic symmetric function is Schur positive, must every finite-variable specialization $X_G(x_1, \dots, x_k)$ have a saturated Newton polytope? A $12$-vertex bipartite graph realizes weights $(6,6,0)$ and $(8,2,2)$ but omits their midpoint $(7,4,1)$.
Evidence graph
No public relationships recorded yet.