ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Q=(u,u−r)Q=(u,u-r) with r≥3r\ge3, and let Pk,1P_{k,1} denote the entries in the first column of the table T(Q)\mathcal T(Q). Recall that for partitions P=(p1≥p2≥⋯ )P=(p_1\ge p_2\ge\cdots) and P′=(p1′≥p2′≥⋯ )P'=(p'_1\ge p'_2\ge\cdots) of the same integer, P≥P′P\ge P' in the Bruhat order when ∑i=1mpi≥∑i=1mpi′\sum_{i=1}^m p_i\ge\sum_{i=1}^m p'_i for every admissible mm. Bruhat-order conjecture. For 1≤k≤r−21\le k\le r-2, one has Pk,1≥Pk+1,1P_{k,1}\ge P_{k+1,1} in the Bruhat order. The source says this follows from the geometric table-locus conjecture, while also describing it as a combinatorial consequence of the proved Table Theorem.

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.