The equivalence between enumerating cyclically symmetric, self-complementary and totally symmetric, self-complementary plane partitions

Simple item page
dc.creatorCiucu, Mihai
dc.date1998-08-04
dc.date.accessioned2026-07-07T05:25:37Z
dc.date.available2026-07-07T05:25:37Z
dc.descriptionWe prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side $2n$ equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube, without explicitly evaluating either of these numbers. This appears to be the first direct proof of this fact. The problem of finding such a proof was suggested by Stanley.
dc.identifierhttps://arxiv.org/abs/math/9808019
dc.identifierhttp://arxiv.org/abs/math/9808019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77247
dc.subjectCombinatorics
dc.titleThe equivalence between enumerating cyclically symmetric, self-complementary and totally symmetric, self-complementary plane partitions
dc.typetext

Files

Collections

arXiv