Combinatorial Enumeration of Polyominoes and Lattice Structures

Combinatorial enumeration of polyominoes and lattice structures addresses the systematic counting of connected tile assemblies on regular grids. A polyomino is a finite union of unit cells joined edge to edge on square, triangular or hexagonal lattices. The field combines exact and asymptotic methods: algebraic and rational generating functions for classes such as convex or column‐convex polyominoes; transfer‐matrix and Temperley‐type approaches for detailed counts; and Monte Carlo and rejection‐free sampling for large-scale problems. As the number of cells grows, one studies growth constants, critical exponents and large‐deviation behaviours, which resonate with statistical mechanics and percolation theory. Extensions to lozenge and hexagonal tilings yield product formulas analogous to plane partition counts, while twisted surfaces and non‐standard lattices refine lower and upper bounds on growth rates. Recent advances include polynomial‐time algorithms for restricted convexity classes, parallelisable integer‐programming frameworks for tiling decision problems and bijective constructions that illuminate fundamental combinatorial structures. Applications span the design of self‐assembling materials, modelling of network resilience and the analysis of first‐passage processes, underscoring the global importance of enumeration techniques in understanding complex spatial organisation.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Combinatorial Enumeration of Polyominoes and Lattice Structures publication trend

The graph below shows the total number of articles in combinatorial enumeration of polyominoes and lattice structures across all publications each year (not limited to Nature Index journals).

Technical terms

Polyomino: A connected union of congruent cells (squares, triangles or hexagons) joined edge to edge on a regular lattice.

Generating function: A formal power series whose coefficients encode the number of combinatorial objects of each size.

Transfer‐matrix method: An algebraic technique that represents boundary states of partial tilings to compute exact counts via matrix iteration.

Z‐convex polyomino: A convex polyomino in which any two cells are connected by a monotone internal path with at most two changes of direction.

Lozenge tiling: A covering of a region of the triangular lattice by rhombi formed from pairs of adjacent equilateral triangles.

References

1. Entropy and chirality in sphinx tilings. Physical Review Research (2024).
2. Counting Polyominoes on Twisted Cylinders. Discrete Mathematics & Theoretical Computer Science (2005).
3. Large deviations of convex polyominoes. Electronic Journal of Probability (2022).
4. Asymptotics of Z-convex polyominoes. RAIRO - Theoretical Informatics and Applications (2024).
5. A Parallelizable Integer Linear Programming Approach for Tiling Finite Regions of the Plane with Polyominoes. Algorithms (2022).
6. Lozenge tilings of hexagons with removed core and satellites. Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions (2022).
7. Greedy polyominoes and first-passage times on random Voronoi tilings. Electronic Journal of Probability (2012).