ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers mm and nn, let m×n\mathbf m\times\mathbf n be the product of two chains, and let inc⁡(m×n)\operatorname{inc}(\mathbf m\times\mathbf n) 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 n≥2n\geq2 and m≥8m\geq8, or if n≥3n\geq3 and m≥n+5m\geq n+5, then inc⁡(m×n)\operatorname{inc}(\mathbf m\times\mathbf n) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.