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

DOI10.1006/jcta.1998.2922zbMath0921.05005arXivmath/9808019OpenAlexW2043406755MaRDI QIDQ1291127

Mihai Ciucu

Publication date: 20 July 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9808019

zbMATH Keywords

symmetriesenumeration problemsplane partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items (2)

A factorization theorem for lozenge tilings of a hexagon with triangular holes ⋮ Four factorization formulas for plane partitions

Cites Work

• The story of 1,2,7,42,429,7436,..
• Symmetries of plane partitions
• Determinant identities
• Plane partitions. V: The TSSCPP conjecture
• Symmetries of plane partitions and the permanent-determinant method
• Some hidden relations involving the ten symmetry classes of plane partitions
• Nonintersecting paths, pfaffians, and plane partitions
• The enumeration of totally symmetric plane partitions
• Four symmetry classes of plane partitions under one roof
• The Problem of the Calissons
• Enumeration of perfect matchings in graphs with reflective symmetry

This page was built for publication: The equivalence between enumerating cyclically symmetric, self-complementary and totally symmetric, self-complementary plane partitions