ID: math/9808017

Plane partitions I: a generalization of MacMahon's formula

August 4, 1998

View on ArXiv
Mihai Ciucu
Mathematics
Combinatorics

The number of plane partitions contained in a given box was shown by MacMahon to be given by a simple product formula. By a simple bijection, this formula also enumerates lozenge tilings of hexagons of side-lengths $a,b,c,a,b,c$ (in cyclic order) and angles of 120 degrees. We present a generalization in the case $b=c$ by giving simple product formulas enumerating lozenge tilings of regions obtained from a hexagon of side-lengths $a,b+k,b,a+k,b,b+k$ (where $k$ is an arbitrary non-negative integer) and angles of 120 degrees by removing certain triangular regions along its symmetry axis.

Similar papers 1

A dual of MacMahon's theorem on plane partitions

October 19, 2012

92% Match
Mihai Ciucu, Christian Krattenthaler
Combinatorics

A classical theorem of MacMahon states that the number of lozenge tilings of any centrally symmetric hexagon drawn on the triangular lattice is given by a beautifully simple product formula. In this paper we present a counterpart of this formula, corresponding to the {\it exterior} of a concave hexagon obtained by turning 120 degrees after drawing each side (MacMahon's hexagon is obtained by turning 60 degrees after each step).

Find SimilarView on arXiv

A $q$-enumeration of lozenge tilings of a hexagon with four adjacent triangles removed from the boundary

February 5, 2015

90% Match
Tri Lai
Combinatorics

MacMahon proved a simple product formula for the generating function of plane partitions fitting in a given box. The theorem implies a $q$-enumeration of lozenge tilings of a semi-regular hexagon on the triangular lattice. In this paper we generalize MacMahon's classical theorem by $q$-enumerating lozenge tilings of a new family of hexagons with four adjacent triangles removed from their boundary.

Find SimilarView on arXiv

Enumeration of lozenge tilings of hexagons with cut off corners

April 4, 2001

89% Match
Mihai Georgia Institute of Technology Ciucu, Christian Universität Wien Krattenthaler
Combinatorics

Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases'' removed from some of its vertices. The case of one vertex corresponds to Proctor's problem. For two vertices there are several cases to consider, and most of them lead to nice enumeration formulas. For three or more vertices there do not s...

Find SimilarView on arXiv

Cyclically Symmetric Lozenge Tilings of a Hexagon with Four Holes

May 2, 2017

88% Match
Tri Lai, Ranjan Rohatgi
Combinatorics

The work of Mills, Robbins, and Rumsey on cyclically symmetric plane partitions yields a simple product formula for the number of lozenge tilings of a regular hexagon, which are invariant under roation by $120^{\circ}$. In this paper we generalize this result by enumerating the cyclically symmetric lozenge tilings of a hexagon in which four triangles have been removed in the center.

Find SimilarView on arXiv

Lozenge Tilings of Hexagons with Intrusions I: Generalized Intrusion

November 15, 2022

88% Match
Seok Hyun Byun, Tri Lai
Combinatorics

MacMahon's classical theorem on the number of boxed plane partitions has been generalized in several directions. One way to generalize the theorem is to view boxed plane partitions as lozenge tilings of a hexagonal region and then generalize it by making some holes in the region and counting its tilings. In this paper, we provide new regions whose numbers of lozenges tilings are given by simple product formulas. The regions we consider can be obtained from hexagons by removin...

Find SimilarView on arXiv

Enumeration of lozenge tilings of a hexagon with a shamrock missing on the symmetry axis

November 8, 2017

88% Match
Tri Lai, Ranjan Rohatgi
Combinatorics

In their paper about a dual of MacMahon's classical theorem on plane partitions, Ciucu and Krattenthaler proved a closed form product formula for the tiling number of a hexagon with a "shamrock", a union of four adjacent triangles, removed in the center (Proc. Natl. Acad. Sci. USA 2013). Lai later presented a $q$-enumeration for lozenge tilings of a hexagon with a shamrock removed from the boundary (European J. Combin. 2017). It appears that the above are the only two positio...

Find SimilarView on arXiv

Lozenge tilings of a hexagon with a horizontal intrusion

April 4, 2021

88% Match
Seok Hyun Byun
Combinatorics

Motivated by a conjecture posed by Fulmek and Krattenthaler, we provide product formulas for the number of lozenge tilings of a semiregular hexagon containing a horizontal intrusion. As a direct corollary, we obtain a product formula for the number of boxed plane partitions with a certain restriction. We also investigate the asymptotic behavior of the ratio between the number of lozenge tilings of a semiregular hexagon containing a horizontal intrusion and that of a semiregul...

Find SimilarView on arXiv

A factorization theorem for lozenge tilings of a hexagon with triangular holes

March 13, 2014

88% Match
Mihai Ciucu, Christian Krattenthaler
Combinatorics
Mathematical Physics

In this paper we present a combinatorial generalization of the fact that the number of plane partitions that fit in a $2a\times b\times b$ box is equal to the number of such plane partitions that are symmetric, times the number of such plane partitions for which the transpose is the same as the complement. We use the equivalent phrasing of this identity in terms of symmetry classes of lozenge tilings of a hexagon on the triangular lattice. Our generalization consists of allow...

Find SimilarView on arXiv

Tiling enumeration of doubly-intruded halved hexagons

December 31, 2017

87% Match
Tri Lai
Combinatorics

Inspired by Propp's intruded Aztec diamond regions, we consider halved hexagons in which two aligned arrays of triangular holes have been removed from their boundaries. Unlike the intruded Aztec diamonds (whose numbers of domino tilings contain some large prime factors in their factorizations), the numbers of lozenge tilings of our doubly-intruded halved hexagons are given by simple product formulas in which all factors are linear in the parameters. In this paper, we present ...

Find SimilarView on arXiv

Lozenge tilings of hexagons with central holes and dents

March 7, 2018

87% Match
Tri Lai
Combinatorics

Ciucu showed that the number of lozenge tilings of a hexagon in which a chain of equilateral triangles of alternating orientations, called a `\emph{fern}', has been removed in the center is given by a simple product formula (Adv. Math. 2017). In this paper, we present a multi-parameter generalization of this work by giving an explicit tiling enumeration for a hexagon with three ferns removed, besides the middle fern located in the center as in Ciucu's region, we remove two ad...

Find SimilarView on arXiv