Content deleted Content added
→Enumeration and aperiodicity: split long sentence |
|||
Line 34:
As a tile all of whose tilings are not fully periodic, the [[prototile]] of a binary tiling solves an analogue of the {{not a typo|<!-- lowercase is intentional -->[[einstein problem]]}} in the hyperbolic plane. This problem asks for a single prototile that tiles only aperiodically; long after the discovery of the binary tilings, it was solved in the Euclidean plane by the discovery of the "hat" and "spectre" tilings. However, the binary tilings are only ''weakly aperiodic'', meaning that no tiling has a two-dimensional group of symmetries. Because they can have one-dimensional symmetries, the binary tilings are not ''strongly aperiodic''.{{r|einstein}}
In binary tilings, more strongly than having all tiles the same shape, all [[Heesch's problem|first coronas]] of tiles have the same shape. The first corona is the set of tiles touching a single central tile. Here, coronas are considered the same if they are reflections of each other. For tilings of the Euclidean plane, having all first coronas the same implies that the tiling is periodic and [[isohedral tiling|isohedral]], meaning that all tiles are symmetric to each other.
==Applications==
|