ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a diagram, and write its flagged Schur character in the Schubert-polynomial basis as

SD=∑wcDw Sw,\mathfrak{S}_D=\sum_w c^w_D\,\mathfrak{S}_w,

where the sum is over all permutations and cDwc^w_D are integers. A diagram is called transparent when it has the transparency property defined in the paper. Nonnegativity conjecture. When DD is transparent, the coefficients cDwc^w_D are nonnegative:

cDw≥0c^w_D\geq 0

for every permutation ww. 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 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.