Show simple item record

Some hidden relations involving the ten symmetry classes of plane partitions

dc.contributor.authorStembridge, John R.en_US
dc.date.accessioned2006-04-10T17:47:07Z
dc.date.available2006-04-10T17:47:07Z
dc.date.issued1994-11en_US
dc.identifier.citationStembridge, John R. (1994/11)."Some hidden relations involving the ten symmetry classes of plane partitions." Journal of Combinatorial Theory, Series A 68(2): 372-409. <http://hdl.handle.net/2027.42/31216>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6WHS-4CVPWT9-W/2/d270a2456d0bc03512e5789cf1362107en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/31216
dc.description.abstractLet B be a partially ordered product of three finite chains. For any group G of automorphisms of B, let NG(B, q) denote the rank generating function for G-invariant order ideals of B. If we regard B as a rectangular prism, NG(B, q) can be viewed as a generating function for plane partitions that fit inside B. Similarly, define NG'(B, q) to be the rank generating function for order ideals of the quotient poset B/G. We prove that NG(B, - 1) and NG'(B, - 1) count the number of plane partitions (i.e., order ideals of B) that are invariant under certain automorphisms and complementation operations on B. Consequently, one discovers that the number of plane partitions belonging to each of the ten symmetry classes identified by Stanley is of the form NG(B, +/- 1) or NG'(B, +/- 1) for some subgroup G of S3, and conversely. We also discuss the occurrence of this phenomenon in general partially ordered sets, and use the theory of P-partitions to derive a criterion for one aspect of it.en_US
dc.format.extent1853320 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleSome hidden relations involving the ten symmetry classes of plane partitionsen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, Michigan 48109-1003, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/31216/1/0000118.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0097-3165(94)90112-0en_US
dc.identifier.sourceJournal of Combinatorial Theory, Series Aen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.