Schur non-positivity conjecture for products of two chains
Statement
For positive integers and , let be the product of two chains, and let denote its incomparability graph. A graph is Schur positive when its chromatic symmetric function is a nonnegative linear combination of Schur functions. Schur non-positivity conjecture. If and , or if and , then is not Schur positive. The paper proves broad families of non-Schur-positive products and gives computational evidence for the remaining ranges covered by this conjecture.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.