Related papers: Plane partitions I: a generalization of MacMahon's…
In this paper, we provide formulas to calculate the partition functions of two types of plane partitions using the crystal melting model introduced by Okounkov, Reshetikhin and Vafa. As applications, we obtain a product formula for the…
We investigate the connection between lozenge tilings and domino tilings by introducing a new family of regions obtained by attaching two different Aztec rectangles. We prove a simple product formula for the generating functions of the…
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…
This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…
We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…
Rota's Twelvefold Way gave formulas for the numbers of partitions which could be formed in twelve scenarios. This proposed AMM article expands Rota's 4 x 3 table. The resulting 6 x 5 table considers a broader collection of…
Consider the probability that an arbitrary chosen lozenge tiling of the hexagon with side lengths a, b, c, a, b, c contains the horizontal lozenge with lowest vertex (x,y) as if it described the distribution of mass in the plane. We compute…
We obtain an explicit formula for a certain weighted enumeration of lozenge tilings of a hexagon with an arbitrary triangular hole. The complexity of our expression depends on the distance from the hole to the center of the hexagon. This…
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…
Motivated by an error-correcting generalization of Bachet's weights problem, we define and classify relaxed complete partitions. We show that these partitions enjoy a succinct description in terms of lattice points in polyhedra, with…
The enumeration of lozenge tilings of hexagons with holes has been studied intensively in recent years. Researchers tried to find shapes and positions of holes in hexagonal regions so that the number of lozenge tilings of the resulting…
We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…
In a series of papers, George Andrews and various coauthors successfully revitalized seemingly forgotten, powerful machinery based on MacMahon's $\Omega$ operator to systematically compute generating functions $\sum_{\la \in P}…
We introduce a new symmetry class of both boxed plane partitions and lozenge tilings of a hexagon, called the $\mathbf{r}$-block diagonal symmetry class, where $\mathbf{r}$ is an $n$-tuple of non-negative integers. We prove that the tiling…
In this paper, we consider various theorems of P.A. MacMahon and M.V. Subbarao. For a non-negative integer $n$, MacMahon proved that the number of partitions of $n$ wherein parts have multiplicity greater than 1 is equal to the number of…
In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…
Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…
Plane partition diamonds were introduced by Andrews, Paule, and Riese (2001) as part of their study of MacMahon's $\Omega$-operator in search for integer partition identities. More recently, Dockery, Jameson, Sellers, and Wilson (2024)…
In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…