Nonnegativity conjecture for Schubert expansions of transparent diagrams
Statement
Let be a diagram, and write its flagged Schur character in the Schubert-polynomial basis as
where the sum is over all permutations and are integers. A diagram is called transparent when it has the transparency property defined in the paper. Nonnegativity conjecture. When is transparent, the coefficients are nonnegative:
for every permutation . This conjecture predicts Schubert positivity for the characters of flagged Schur modules associated with transparent diagrams; the source motivates it through computer experimentation, while noting that related classes such as translucent and percentage-avoiding diagrams can have negative coefficients.
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.