Plane partitions II: 5 1/2 symmetry classes
Mihai Ciucu, Christian Krattenthaler
Abstract
We present new, simple proofs for the enumeration of five of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous proofs of these four cases were quite complicated. For one more symmetry class we give an elementary proof in the case when two of the sides of the box are equal. Our results include simple evaluations of the determinants (δij+x+i+j i)0≤ i,j≤ n-1 and (x+i+j 2j-i)0≤ i,j≤ n-1, notorious in plane partition enumeration, whose previous evaluations were quite intricate.
Create a lesson
Related papers
Decay-Ramsey Sequences
Francesco Di Braccio, Simon Griffiths, Pedram Noohi et al.
Hypergraphs with the smallest Hall ratio are still hard to colour
Veronica Bitonti, Freddie Illingworth, Pedram Noohi et al.
The k-color poset Ramsey number of the diamond is 2k
Tom Bohman, Will Cong, Quentin Dubroff et al.
Intersecting families of loose spanning hypertrees
Yury Person, Thomas Schweser
The terminal leave in random greedy hypergraph matching
Peter Keevash
Two Perfect One-Factorizations of K92
Tomasz Maciosowski