New Invariants for Permutations, Orders and Graphs
arXiv:1908.04841 · doi:10.1016/j.aam.2020.102080
Abstract
We study the symmetric function and polynomial combinatorial invariants of Hopf algebras of permutations, posets and graphs. We investigate their properties and the relations among them. In particular, we show that the chromatic symmetric function and many other invariants have a property we call positively -alternating. This property of positively -alternating leads to Schur positivity and -positivity when applying the operator at . We conclude by showing that the invariants we consider can be expressed as scheduling problems.
26 pages, some colors, first final draft comments welcome