Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Vailaya, Aarush"'
Autor:
Tom, Foster, Vailaya, Aarush
We describe a way to decompose the chromatic symmetric function as a positive sum of smaller pieces. We show that these pieces are $e$-positive for cycles. Then we prove that attaching a cycle to a graph preserves the $e$-positivity of these pieces.
Externí odkaz:
http://arxiv.org/abs/2410.21762