(--1)-enumeration of plane partitions with complementation symmetry

From MaRDI portal
Publication:1398286



Abstract: We compute the weighted enumeration of plane partitions contained in a given box with complementation symmetry where adding one half of an orbit of cubes and removing the other half of the orbit changes the weight by -1 as proposed by Kuperberg. We use nonintersecting lattice path families to accomplish this for transpose-complementary, cyclically symmetric transpose-complementary and totally symmetric self-complementary plane partitions. For symmetric transpose-complementary and self-complementary plane partitions we get partial results. We also describe Kuperberg's proof for the case of cyclically symmetric self-complementary plane partitions.


A plane partition \(P\) is defined as a finite set of points \((i,j,k)\) with \(i,j,k> 0\) such that if \((i,j,k)\in P\) and \(1\leq i'\leq i\), \(1\leq j'\leq j\), \(1\leq k'\leq k\), then \((i',j',k')\in P\). These points are interpreted as midpoints of a cube. If \(i\leq a\), \(j\leq b\) and \(k\leq c\) for all cubes of the plane partition, then the plane partition is said to be contained in a box with side lengths \(a\), \(b\), \(c\). Such partitions have several kinds of symmetries and complementation properties. The present paper is devoted to weighted enumerations of classes of plane partitions with complementation symmetry. The author's results confirm a conjecture posed by \textit{G. Kuperberg} [Electron. J. Comb. 5, Research paper R46 (1998); printed version J. Comb. 5, 707-740 (1998; Zbl 0906.05055)]. It states that ``nice expressions for a \((-1)\)-enumeration of such plane partitions certainly exist.





Describes a project that uses

Uses Software






This page was built for publication: (--1)-enumeration of plane partitions with complementation symmetry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398286)