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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose I have a regular grid of identical hexagons that tile the plane, that is a hexagonal lattice.

How can I determine if a connected subset of these hexagons (i.e. a poly-hex) 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
3  
The polyhexes that tile by translation, up to order 9, can be found by links from polyomino.org.uk/mathematics/polyform-tiling --- 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 mysite.verizon.net/vze16nctz/Tilings/Article/planar.ps – Gerry Myerson Mar 12 '13 at 5:04

John Conway obtained an algorithm for deciding (a particular case of) the tiling problem with polyminoes and polyhexes.

Such algorithm is explained by Thurston here.

share|cite|improve this answer

Your Answer

 
discard

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.