Tilings of rectangles with T-tetrominoes

Authors:
Michael Korn;Igor Pak
Affiliations:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA;Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA
Venue:
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Year:
2004

Citing 9
Cited 0

Approximating the permanent

SIAM Journal on Computing
Conway's tiling groups

American Mathematical Monthly
Algorithms for random generation and counting: a Markov chain approach

Algorithms for random generation and counting: a Markov chain approach
Complexity: knots, colourings and counting

Complexity: knots, colourings and counting
Domino tiling in planar graphs with regular and bipartite dual

Theoretical Computer Science - Special issue: selected papers from “GASCOM '94” and the “Polyominoes and Tilings” workshops
Exact sampling with coupled Markov chains and applications to statistical mechanics

Proceedings of the seventh international conference on Random structures and algorithms
Tiling groups for Wang tiles

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Markov Chain Algorithms for Planar Lattice Structures

SIAM Journal on Computing
Tile invariants: new horizons

Theoretical Computer Science - Special issue: Tilings of the plane

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that any two tilings of a rectangular region by T-tetrominoes are connected by moves involving only 2 and 4 tiles. We also show that the number of such tilings is an evaluation of the Tutte polynomial. The results are extended to a more general class of regions.