The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I

DOI10.1007/BF01626027zbMath0917.05004arXivmath/9712244MaRDI QIDQ1272360

Markus Fulmek, Christian Krattenthaler

Publication date: 2 August 1999

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9712244

zbMATH Keywords

nonintersecting lattice paths; enumeration problem; hexagon; rhombus tilings; plane partitions; lozenge tilings; determinant evaluations; matchings factorization

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A17: Combinatorial aspects of partitions of integers

33C20: Generalized hypergeometric series, ({}_pF_q)

05B45: Combinatorial aspects of tessellation and tiling problems

52C20: Tilings in (2) dimensions (aspects of discrete geometry)

Related Items

The five-vertex model and boxed plane partitions, The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II, Enumeration of Lozenge tilings of hexagons with cut-off corners, Advanced determinant calculus: a complement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shape of a typical boxed plane partition
• Enumeration of tilings of diamonds and hexagons with defects
• The number of centered lozenge tilings of a symmetric hexagon
• Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions
• Some \(q\)-analogues of determinant identities which arose in plane partition enumeration
• Proof of a determinant evaluation conjectured by Bombieri, Hunt and van Poorten
• The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II
• Nonintersecting paths, pfaffians, and plane partitions
• Generating functions for plane partitions of a given shape
• The Problem of the Calissons
• A new proof of the M-R-R conjecture-including a generalization
• Enumeration of perfect matchings in graphs with reflective symmetry