Three Infinite Families Separating Schur Positivity, the Strongly Nice Property, and the Nice Property
Kai Zhang
Abstract
For a graph G, Schur positivity of XG implies that G is strongly nice, and every strongly nice graph is nice. We construct three infinite families separating these properties. We first give a connected family Ft, t6, that is strongly nice but not Schur positive. We then prove that homogeneous strongly nice symmetric functions with nonnegative monomial coefficients are closed under multiplication, and hence that strongly nice graphs are closed under disjoint union. As an application, for H=K3,3-e, the graphs \[ Mt=H Kt, t3, \] form a disconnected family that is strongly nice but not Schur positive. Finally, we define \[ Nr=Kr(K22K1), r2, \] and prove that every Nr is connected and nice but not strongly nice. We also introduce the level-k nice property and show that the level depth of Nr is 4r!.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato