Enumeration of Cylindric Plane Partitions - part I
Abstract
Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. The first result of this paper is a (q,t)-analog of Borodin's identity which extends previous work by Okada in the reverse plane partition case. Our proof uses commutation relations for (q,t)-vertex operators acting on Macdonald polynomials as given by Garsia, Haiman and Tesla. The second result of this paper is an explicit combinatorial interpreation of the (q,t)-Macdonald weight in terms of a non-intersecting lattice path model on the cylinder.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.