Enumeration of rhombus tilings of a hexagon which contain a fixed rhombus on its symmetry axis
Mihai Ciucu, Markus Fulmek, Christian Krattenthaler
math.COarXiv:math/9712201
Abstract
We compute the number of rhombus tilings of a hexagon with sides N,M,N,N,M,N, which contain a fixed rhombus on the symmetry axis. A special case solves a problem posed by Jim Propp.
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