A bijective proof of Kadell's conjecture on plane partitions
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.
- The bijection between plane partitions and nonnegative matrices
- A symmetrical plane partition correspondence
- A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
- Doppelgängers: Bijections of Plane Partitions
- Generating functions for plane partitions of a given shape
This page was built for publication: A bijective proof of Kadell's conjecture on plane partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810023)
