AbstractWe introduce a new symmetry operation, called complementation, on plane partitions whose three-dimensional diagram is contained in a given box. This operation was suggested by work of Mills, Robbins, and Rumsey. There then arise a total of ten inequivalent problems concerned with the enumeration of plane partitions with a given symmetry. Four of these ten problems had been previously considered. We survey what is known about the ten problems and give a solution to one of them. The proof is based on the theory of Schur functions, in particular the Littlewood-Richardson rule. Of the ten problems, seven are now solved while the remaining three have conjectured simple solutions
The combinatorial theory of partitions has a number of applications including the representation the...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
AbstractWe give another proof for the (−1)-enumeration of self-complementary plane partitions with a...
AbstractWe introduce a new symmetry operation, called complementation, on plane partitions whose thr...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
AbstractWe compute the weighted enumeration of plane partitions contained in a given box with comple...
AbstractR. P. Stanley (1986, J. Combin. Theory Ser. A43, 103–113) gives formulas for the number of p...
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the...
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the...
AbstractMacMahon conjectured the form of the generating function for symmetrical plane partitions, a...
AbstractA plane partition is totally symmetric if, as an order ideal of N3, it is invariant under al...
AbstractWe give another proof for the (−1)-enumeration of self-complementary plane partitions with a...
AbstractWe compute the weighted enumeration of plane partitions contained in a given box with comple...
AbstractThis paper is devoted to proving the conjecture by Mills, Robbins, and Rumsey that the numbe...
The combinatorial theory of partitions has a number of applications including the representation the...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
AbstractWe give another proof for the (−1)-enumeration of self-complementary plane partitions with a...
AbstractWe introduce a new symmetry operation, called complementation, on plane partitions whose thr...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find ...
AbstractWe compute the weighted enumeration of plane partitions contained in a given box with comple...
AbstractR. P. Stanley (1986, J. Combin. Theory Ser. A43, 103–113) gives formulas for the number of p...
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the...
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the...
AbstractMacMahon conjectured the form of the generating function for symmetrical plane partitions, a...
AbstractA plane partition is totally symmetric if, as an order ideal of N3, it is invariant under al...
AbstractWe give another proof for the (−1)-enumeration of self-complementary plane partitions with a...
AbstractWe compute the weighted enumeration of plane partitions contained in a given box with comple...
AbstractThis paper is devoted to proving the conjecture by Mills, Robbins, and Rumsey that the numbe...
The combinatorial theory of partitions has a number of applications including the representation the...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
AbstractWe give another proof for the (−1)-enumeration of self-complementary plane partitions with a...