Symmetry and Hankel structure of minimal matrices of fixed RSK shape

Less than 1 year old · traced to

Let λ\lambda be a partition with nn parts, and let M=(mi,j)1≤i,j≤n∈MλM=(m_{i,j})_{1\le i,j \le n}\in\mathcal{M}_\lambda be a minimal matrix of shape λ\lambda. A matrix is Hankel when its entries depend only on the sum of their indices. Symmetry and Hankel conjecture. Every minimal matrix MM of shape λ\lambda is symmetric,

mi,j=mj,ifor all 1≤i,j≤n,m_{i,j}=m_{j,i}\quad\text{for all }1\le i,j\le n,

and is Hankel: there exists a sequence of integers s2,s3,…,s2ns_2,s_3,\dots,s_{2n} such that

mi,j=si+jfor all 1≤i,j≤n.m_{i,j}=s_{i+j}\quad\text{for all }1\le i,j\le n.

The conjecture extends the characterization of minimum-inversion permutations of fixed RSK shape to nonnegative integer matrices of the smallest possible size. It is proved in the paper for two-row partitions, while the general case remains open.

References

Primary source

Nimisha Pahuja, “Minimal Inversions in Integer Matrices of Fixed RSK Shape”, arXiv:2602.14931 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.