The tail-end inversion conjecture for rectangular tableaux
Statement
Let and . Consider the -row shapes
For each integer , let and denote the corresponding sets of tableaux with the indicated inversion numbers, and let be the nd triangular number. Tail-end inversion conjecture. One has
for all . The conjecture predicts a uniform equality between inversion enumerators for these two closely related -row shapes in the tail range beyond .
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.