A new proof of the M-R-R conjecture-including a generalization
The author evaluates the determinant \[ \underset{0\leq i,j\leq n-1}{\text{det}} \Biggl(\delta_{ij}+ \sum^{n-1}_{t,k= 0} {i+\mu\choose t}{k+\nu\choose k-t} {j-k+\mu-1\choose j-k} 2^{k-t}\Biggr) \] which gives the 2-enumeration of certain shifted plane partitions. This generalizes a result of \textit{G. E. Andrews} [Aequationes Math. 33, 230-250 (1987; Zbl 0632.05005)], who evaluated this determinant for \(\nu= 0\), thus proving a conjecture of \textit{W. H. Mills}, \textit{D. P. Robbins} and \textit{H. Rumsey} [Discrete Math. 67, 43-55 (1987; Zbl 0656.05006)] (the MRR conjecture). The proof involves hypergeometric series identities.
- Alternating sign matrices and descending plane partitions
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Binomial determinants, paths, and hook length formulae
- Enumeration of a symmetry class of plane partitions
- scientific article; zbMATH DE number 3219699 (Why is no real title available?)
- Nonintersecting paths, pfaffians, and plane partitions
- Plane partitions. III: The weak Macdonald conjecture
- Plane partitions. IV: A conjecture of Mills-Robbins-Rumsey
- Proof of the Macdonald conjecture
- Plane partitions. IV: A conjecture of Mills-Robbins-Rumsey
- Determinants in plane partition enumeration
- The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I
- A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration
- New proofs of determinant evaluations related to plane partitions
- Factorization theorems for classical group characters, with applications to alternating sign matrices and plane partitions
- A proof of the Bender-Knuth conjecture
This page was built for publication: A new proof of the M-R-R conjecture-including a generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700078)
