A bijective proof of Kadell's conjecture on plane partitions (Q810023): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A bijective proof of Kadell's conjecture on plane partitions |
scientific article |
Statements
A bijective proof of Kadell's conjecture on plane partitions (English)
0 references
1990
0 references
A weight preserving bijection is obtained from \({\mathcal F}^ m_{r,u}\) to \({\mathcal F}^ m_{\mu}\times {\mathcal G}^ m_ r\), where \({\mathcal F}^ m_{r,u}\) is the set of all plane partitions whose entries are \(\leq n\) and whose entries below the r-th row form a column strict plane partition of type \(\mu\), and \({\mathcal F}^ m_{\mu}\) the set of all column strict plane partitions of type \(\mu\) whose entries are \(\leq m\), and \({\mathcal G}^ m_ r\) the set of all plane partitions with at most r rows, whose entries are \(\leq m\). This confirms a conjecture of Kadell. A partition \(\mu\) of a positive integer n is a finite array of positive integers \(\mu_ 1,\mu_ 2,...,\mu_ k,\mu_ 1\geq \mu_ 2\geq...\geq \mu_ k,\) \(u_ 1+u_ 2+...+u_ k=n.\) A plane partition \(\lambda\) of type \(\mu\), where \(\mu\) is a partition \(\mu_ 1\mu_ 2...\mu_ k\), is an array of positive integers whose entries are weakly decreasing along each column and row.
0 references
weight preserving bijection
0 references
plane partitions
0 references