A Note on Tiling with Integer-Sided Rectangles

  title={A Note on Tiling with Integer-Sided Rectangles},
  author={Richard W. Kenyon},
  journal={J. Comb. Theory, Ser. A},
  • R. Kenyon
  • Published 28 November 1994
  • Mathematics
  • J. Comb. Theory, Ser. A
We show how to determine if a given rectilinear polygon can be tiled with rectangles, each having an integer side. 

Figures from this paper

Minimizing the Number of Tiles in a Tiled Rectangle

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of

How to Tile by Dominoes the Boundary of a Polycube

It is proved that the boundary of a polycube has always a tiling by foldable dominoes and the adjacency graph of the unit squares in the Boundary of a spherical poly cube has a Hamiltonian cycle.

Tiling a Polygon with Two Kinds of Rectangles

A quadratic time algorithm is given which, given a polygon F as input, produces a tiling of F with translated copies of the authors' rectangles (or indicates that there is no tiling), and it is proved that any pair oftilings can be linked by a sequence of local transformations of tilings, called flips.

Optimal Partial Tiling of Manhattan Polyominoes

This work has worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which it gives an algorithm linear in the number of columns, borrowed from traditional graph optimisation problems.

Tiling a Manhattan Polyomino with Bars

  • O. Bodini
  • Mathematics
    Electron. Notes Discret. Math.
  • 2001

Tiling simply connected regions with rectangles

Tile invariants: new horizons

  • I. Pak
  • Mathematics
    Theor. Comput. Sci.
  • 2003

Group Theory and Tiling Problems

Tiling subsets of the plane by polygonal shapes or more generally of subsets of higher-dimensional spaces by polyhedra is intimately connected with group theory. The factorization theory of groups

Ribbon tilings and multidimensional height functions

We fix n and say a square in the two-dimensional grid indexed by (x, y) has color c if x + y ≡ c (mod n). A ribbon tile of order n is a connected polyomino containing exactly one square of each

Ribbon Tile Invariants from the Signed Area

Here is a complete proof of the conjecture, which works by associating ribbon tiles with certain polygons in the complex plane, and deriving invariants from the signed area of these polygons.



Tiling polygons with parallelograms

This paper gives matching necessary and sufficient conditions on the polygon to be tilable and characterize the set of possible tilings and provides an efficient algorithm for constructing a tiling.

Tiling a polygon with rectangles

  • C. MathieuR. Kenyon
  • Mathematics
    Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
A linear time algorithm for deciding if a polygon can be tiled with 1 * m and k * 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem when the tile types are m * k and m * m.

Tiling with Squares and Square-tileable Surfaces

We introduce thèsquare tiling group' and use it to give necessary conditions on a planar polygon to be tileable with squares. We deene square tilings on Riemann surfaces, and compute the Euclidean

Tiling with polyominoes and combinatorial group theory

Conway's tiling groups

John Conway discovered a technique using infinite, finitely presented groups that in a number of interesting cases resolves the question of whether a region in the plane can be tessellated by given

Fourteen proofs of a result about tiling a rectangle