Mills–Robbins–Rumsey's monotone-triangle correspondence conjecture

From papers

Let \TSPPnk\TSPP{n}^{k} be the subset of triangular shifted plane partitions whose entries in the first n1kn-1-k columns attain their maximal values nn. Let \MTnk\MT{n}^{k} be the set of monotone triangles whose entries in the first nkn-k columns attain their minimum values ji+1j-i+1. Mills–Robbins–Rumsey's monotone-triangle correspondence conjecture. For n2n\geq2 and k=0,1,,n1k=0,1,\dots,n-1,

\TSPPnk=\MTnk.\lvert\TSPP{n}^{k}\rvert=\lvert\MT{n}^{k}\rvert.

This proposes an equality between restricted TSSCPPs and restricted monotone triangles, extending the known correspondence between alternating sign matrices and monotone triangles.

Progress summary

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

Sources & referencesView supporting material

Primary source

Masao Ishikawa, “On refined enumerations of totally symmetric self-complementary plane partitions I”, arXiv:math/0602068 (2006).

Solutions 0

No solutions have been posted yet.