ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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.