Plane partitions I: a generalization of MacMahon's formula
Mihai Ciucu
Abstract
The number of plane partitions contained in a given box was shown by MacMahon to be given by a simple product formula. By a simple bijection, this formula also enumerates lozenge tilings of hexagons of side-lengths a,b,c,a,b,c (in cyclic order) and angles of 120 degrees. We present a generalization in the case b=c by giving simple product formulas enumerating lozenge tilings of regions obtained from a hexagon of side-lengths a,b+k,b,a+k,b,b+k (where k is an arbitrary non-negative integer) and angles of 120 degrees by removing certain triangular regions along its symmetry axis.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz