Lozenge Tilings of a Halved Hexagon with an Array of Triangles Removed from the Boundary, Part II

  • Tri Lai
Keywords: Perfect matching, Plane partition, Lozenge tiling, Dual graph, Graphical condensation

Abstract

Proctor's work on staircase plane partitions yields an exact enumeration of lozenge tilings of a halved hexagon on the triangular lattice. Rohatgi later extended this tiling enumeration to a halved hexagon with a triangle cut off from the boundary. In his previous paper, the author provedĀ  a common generalization of Proctor's and Rohatgi's results by enumerating lozenge tilings of a halved hexagon in the case an array of an arbitrary number of triangles has been removed from a non-staircase side. In this paper we consider the other case when the array of triangles has been removed from the staircase side of the halved hexagon. Our result also implies an explicit formula for the number of tilings of a hexagon with an array of triangles removed perpendicularly to the symmetry axis.

Published
2018-12-21
Article Number
P4.58