ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ww be a reduced sl3\mathfrak{sl}_3 web, let sis_i be a simple transposition in the symmetric-group action, let si⋅ws_i\cdot w be expanded in the reduced-web basis, let r(w)r(w) denote rank, and let ⪯S\preceq_S be the shadow-containment partial order. For every reduced summand w~\widetilde{w} of si⋅ws_i\cdot w,

w~ is a reduced summand of si⋅w.\widetilde{w}\text{ is a reduced summand of }s_i\cdot w.

Rank-inequality conjecture. One has

r(w~)≤r(w)+1.r(\widetilde{w})\leq r(w)+1.

Furthermore, if w~⪯Sw\widetilde{w}\preceq_S w, then

r(w~)≤r(w).r(\widetilde{w})\leq r(w).

These inequalities are proposed as sufficient local estimates for the rank-separation conjecture, replacing corresponding shadow-containment statements. They remain open.

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.