Any parallelogram is a rep-*n*^{2} rep-tile, and tiles the
plane with one copy per unit cell.

Specific classes of parallelograms are squares (all angles and sides equal), rectangles (all angles equal) and rhombi (all sides equal). Several classes of polyforms include parallelograms, including polyominos, polyplets, polyabolos (aka polytans), polyiamonds and polydrafters.

Iterated Function System constructions that produce only rectangles are described here.

square (monomino) |
|||||

rectangle (domino) |
|||||

rhombus (diamond) |
|||||

parallelogram (diabolo) |
|||||

parallelogram (didrafter) |

In the simplest construction of these figures all the transforms are n-fold contractions combined with translations. This may be written

T_{rs}: p → p/n + r**a** + s**b**,
r,s ∈0..n-1, where **a** and **b** are non-colinear vectors.

These IFSs have two degrees of freedom, which means that their attractors
include an uncountably infinite number of dissimilar parallelograms. The
degrees of freedom may be parameterised as s**t**retch and s**k**ew. If
the archetypal IFS is made that of the square with **a** = **1** and
**b** = **i**, then the generalised IFS can be written as **a** =
**t** and **b** = **k** + **i**, i.e.

T_{rs}: p → p/n + r**t** + s**k** +
s**i**, r,s ∈0..n-1

However, because of the symmetry of the attractors, the attractors are
degenerate, i.e. any particular parallelogram can be produced by more than one
IFS. In all cases any element of the parallelogram may be rotated by 180°,
giving 2^{n2} different IFSs. In the case of rectangles and
rhombi any element may additionally be reflected in either or both of two axes,
giving 8^{n2} different IFSs. In the case of squares any
element may also be rotated by 90° or 270°, instead of 0° or 180°, giving
16^{n2} different IFSs.

Furthermore some particular figures have additional IFSs; for example in the
domino pairs of elements form a square, and any or all these can collectively
by rotated by 90°. Thus the rep-4 domino is 16384 (4.8^{4}) rather
than 4096 (8^{4}) -fold degenerate.

This degeneracy becomes significant when applying various algorithmic methods of generating new reptiles and irreptiles from a given reptile or irreptile.

There are also rep-*mn* rectangles, including two with rep- numbers
less than 4.

rep-n rectangle | |||||

rep-2n rectangle | |||||

rep-3n rectangle |

The rep-*nn* rectangle is square (one of the degenerate alternatives to
the rep-*n*^{2} square above). The rep-*nm* rectangle is the
same as the rep-*mn* rectangle, but rotated by 90°.

The simplest construction is a combination of an anticlockwise rotation by 90°, combined with contraction by √(mn) and a translation, which may be written as

T_{rs}: p → pe^{iπ/2}/√(mn) +
r**1** + (s-1)√(m/n)**i**, r ∈1..n, s ∈1..m, where **1**
and **i** are orthogonal unit vectors.

These IFSs have no degrees of freedom, their attractors being the √n:m rectangles. These can be placed in a one-to-one correspondence with the rational numbers (m/n), and hence form a countably infinite set of attractors.

The √n:m rectangles can also be generated by a combination of reflection in the x-axis, anticlockwise rotation by 90°, contraction by √(mn) and a translation, which may be written as

T_{rs}: p → p̄e^{iπ/2}/√(mn)
+ (r-1)**1** + (s-1)√(m/n)**i**, r ∈1..n, s ∈1..m, where **1**
and **i** are orthogonal unit vectors.

rep-n rectangle | |||||

rep-2n rectangle | |||||

rep-3n rectangle |

These are a special case of the rep-*mn* parallelograms, which are sets
of attractors with a single degree of freedom, which can be parameterised as
the angle of the lower left corner.

rep-2 parallelgram | ||

rep-3 parallelgram | ||

rep-4 parallelgram | ||

rep-4 parallelgram | ||

rep-6 parallelgram |

There are many ways in which irrep-tile parallograms can be constructed.

The simplest to take a rep-tile, and dissect one or more of the copies further.

A greater variety can be generated from the rep-*n*^{2}
parallelograms (*n*>2). A block of *k*^{2}
(*k*<*n*) parallelograms can be replaced by a single
parallelogram. This can be repeated while blocks of *m*^{2}
parallelograms (*m*≥2) remain.

n=3 | |||||

n=3 |

n=5 | ||||

n=5 | ||||

n=5 |

Several examples can be found on Erich Friedman's Math Magic pages.

- Integer Square Tilings
- Counting Square Tilings
- Square Strip Tilings
- Partridge Packings
- Hanoi Square Tilings
- No Touch Tilings
- Anti-Partridge Tilings

**Sources**:

**References**

- M. Reid's rectifiable polyomino pages
- Karl Dahlke's polyomino pages: information of tilings of rectangles by rectifiable polyominos
- Polyomino Rep-tiles at Al Clarke's PolyPages

© 2007, 2009, 2014 Stewart R. Hinsley