Related papers: Two formulas for plane paritions
We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…
All ten symmetry classes of plane partitions that fit in a given box are known to be enumerated by simple product formulas, but there is still no unified proof for all of them. Progress towards this goal can be made by establishing…
We present new, simple proofs for the enumeration of five of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous…
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with results by Andrews [J. Combin. Theory Ser. A 66 (1994), 28-39]…
Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
A method of Proctor [European J. Combin. 5 (1984), no. 4, 331-350] realizes the set of arbitrary plane partitions in a box and the set of symmetric plane partitions as bases of linear representations of Lie groups. We extend this method by…
We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…
Inspired by Gansner's elegant $k$-trace generating function for rectangular plane partitions, we introduce two novel operators, $\varphi_{z}$ and $\psi_{z}$, along with their combinatorial interpretations. Through these operators, we derive…
We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.
We prove a product formula for the remaining cases of the weighted enumeration of self-complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the…
Nice formulae for plane partitions with bounded size of parts (or boxed plane partitions), which generalize the norm-trace generating function by Stanley and the trace generating function by Gansner, are exhibited. The derivation of the…
We study the plane automorphisms given by polynomials with certain degree decompositions.
We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…
Basis partitions are minimal partitions corresponding to successive rank vectors. We show combinatorially how basis partitions can be generated from primary partitions which are equivalent to the Rogers-Ramanujan partitions. This leads to…
This paper considers three different partition relations from partition calculus, two of which are pair relations and one of which is a triple relation. An examination of the first partition relation and the ramification argument used to…
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…
We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.
The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.
Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a…