ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\geq 1 and m≥2m\geq 2. Consider the mm-row shapes

λ=(n,…,n),λ~=(n+1,n,…,n,n−1).\lambda=(n,\ldots,n),\qquad \widetilde{\lambda}=(n+1,n,\ldots,n,n-1).

For each integer ii, let Si(λ)S_i(\lambda) and Si−m+1(λ~)S_{i-m+1}(\widetilde{\lambda}) denote the corresponding sets of tableaux with the indicated inversion numbers, and let Tm−2T_{m-2} be the (m−2)(m-2)nd triangular number. Tail-end inversion conjecture. One has

∣Si(λ)∣=∣Si−m+1(λ~)∣\lvert S_i(\lambda)\rvert=\lvert S_{i-m+1}(\widetilde{\lambda})\rvert

for all i>nTm−2i>nT_{m-2}. The conjecture predicts a uniform equality between inversion enumerators for these two closely related mm-row shapes in the tail range beyond nTm−2nT_{m-2}.

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.