Plane partitions I: a generalization of MacMahon's formula
Mihai Ciucu

TL;DR
This paper generalizes MacMahon's formula for plane partitions by providing new product formulas for enumerating lozenge tilings of modified hexagonal regions with specific side-lengths and removed triangles.
Contribution
It introduces a novel generalization of MacMahon's formula for plane partitions, extending enumeration results to more complex hexagonal regions with triangular removals.
Findings
New product formulas for lozenge tilings of generalized hexagons
Extension of MacMahon's enumeration to regions with triangular cuts
Simplified bijections linking plane partitions and tilings
Abstract
The number of plane partitions contained in a given box was shown by MacMahon to be given by a simple product formula. By a simple bijection, this formula also enumerates lozenge tilings of hexagons of side-lengths (in cyclic order) and angles of 120 degrees. We present a generalization in the case by giving simple product formulas enumerating lozenge tilings of regions obtained from a hexagon of side-lengths (where is an arbitrary non-negative integer) and angles of 120 degrees by removing certain triangular regions along its symmetry axis.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Mathematics and Applications
