Rhombus Tilings of a Hexagon with Three
β
Theresia EisenkΓΆlbl
π
Article
π
1999
π
Elsevier Science
π
English
β 195 KB
We compute the number of rhombus tilings of a hexagon with sides a, b, c, a, b, c with three fixed tiles touching the border. The particular case a=b=c solves a problem posed by Propp. Our result can also be viewed as the enumeration of plane partitions having a rows and b columns, with largest entr