Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Suppose I have a regular grid of identical hexagons that tile the plane. How can I determine if a connected subset of these hexagons can tile the plane by translations that form a (Bravais) lattice? For reference, here is a picture:

enter image description here

The four shapes on the right can tile the plane, while the left-most shape cannot.

share|cite|improve this question
You mean just translations, no rotations allowed? That may be decidable. – Will Jagy Mar 12 '13 at 4:14
That is correct, only translations, and no rotations. Not only that, but the overall tiling should be periodic. – Victor Liu Mar 12 '13 at 5:01
The polyhexes that tile by translation, up to order 9, can be found by links from --- e.g., there are 6572 polyhexes of order 9, of which only 387 tile by translation. There are also references there to the literature. See also – Gerry Myerson Mar 12 '13 at 5:04

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.