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

From MaRDI portal
Revision as of 08:38, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I
scientific article

    Statements

    The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. I (English)
    0 references
    0 references
    2 August 1999
    0 references
    Let be given a hexagon in the plane from the regular triangular lattice with sides \(a,b,c,a,b,c\). A classic result of MacMahon gives a product formula for the number of rhombus tilings of this hexagon. The present paper solves a refined enumeration problem: what is the number of rhombus tilings that contain the \(\ell\)th rhombus on the symmetry axis of the hexagon. From the closed form an asymptotic formula is also derived.
    0 references
    lozenge tilings
    0 references
    plane partitions
    0 references
    nonintersecting lattice paths
    0 references
    matchings factorization
    0 references
    determinant evaluations
    0 references
    hexagon
    0 references
    rhombus tilings
    0 references
    enumeration problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references