Problems in the Enumeration of Tilings
arXiv:2109.01466
Abstract
Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and applications to diverse mathematical areas. In 1999, James Propp published his well-known list of 32 open problems in the field. The list has got much attention from experts around the world. After two decades, most of the problems on the list have been solved and generalized. In this paper, we propose a set of new tiling problems. This survey paper contributes to the Open Problems in Algebraic Combinatorics 2022 conference (OPAC 2022) at the University of Minnesota.
arXiv comment35 pages, many figures; for the "Open Problems in Algebraic Combinatorics" AMS volume to accompany the OPAC 2022 conference at the University of Minnesota
References in corpus (12)
- The shape of a typical boxed plane partition
- A dual of MacMahon's theorem on plane partitions
- Plane partitions I: a generalization of MacMahon's formula
- A shuffling theorem for lozenge tilings of doubly-dented hexagons
- A Shuffling Theorem for Centrally Symmetric Tilings
- Plane partitions with bounded size of parts and biorthogonal polynomials
- Ratio of tiling generating functions of semi-hexagons and quartered hexagons with dents
- Electrical Lie Algebra of Classical Types
- Lozenge Tiling Function Ratios for Hexagons with Dents on Two Sides
- Multiplicative partition functions for reverse plane partitions derived from an integrable dynamical system
- Tilted Halved Hexagons: Hexagons, Semi-hexagons, and Halved Hexagons Under One Roof
- A New Proof for a Triple Product Formula for Plane Partitions