1 citations · 2 across the 11 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
math.CO2024
Adjacent cycle-chains are -positive
Foster Tom, Aarush Vailaya
We describe a way to decompose the chromatic symmetric function as a positive sum of smaller pieces. We show that these pieces are -positive for cycles. Then we prove that attac…
math.CO2024
Graphs missing a connected partition
Foster Tom
We prove that a graph with a cut vertex whose deletion produces at least five connected components must be missing a connected partition of some type. We prove that this also holds…
math.CO2024
Chromatic symmetric functions and change of basis
Bruce E. Sagan, Foster Tom
We prove necessary conditions for certain elementary symmetric functions, , to appear with nonzero coefficient in Stanley's chromatic symmetric function as well as in the gene…