From Aztec diamonds to pyramids: Steep tilings

Combinatorial probability (60C05) Symmetric functions and generalizations (05E05) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of tessellation and tiling problems (05B45) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We introduce a family of domino tilings that includes tilings of the Aztec diamond and pyramid partitions as special cases. These tilings live in a strip of

m a t h b b Z^{2}

of the form

1 l e q x - y l e q 2 e l l

for some integer

e l l g e q 1

, and are parametrized by a binary word

w i n {+, -}^{2 e l l}

that encodes some periodicity conditions at infinity. Aztec diamond and pyramid partitions correspond respectively to

w = (+ -)^{e} l l

and to the limit case

w = +^{i} n f t y -^{i} n f t y

. For each word

w

and for different types of boundary conditions, we obtain a nice product formula for the generating function of the associated tilings with respect to the number of flips, that admits a natural multivariate generalization. The main tools are a bijective correspondence with sequences of interlaced partitions and the vertex operator formalism (which we slightly extend in order to handle Littlewood-type identities). In probabilistic terms our tilings map to Schur processes of different types (standard, Pfaffian and periodic). We also introduce a more general model that interpolates between domino tilings and plane partitions.

Recommendations

Cites work

Cited in

(21)

This page was built for publication: From Aztec diamonds to pyramids: Steep tilings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347286)