Show simple item record

dc.contributor.authorCurrie, James D.
dc.contributor.authorSimpson, Jamie
dc.date.accessioned2018-01-15T20:22:54Z
dc.date.available2018-01-15T20:22:54Z
dc.date.issued2002-07-03
dc.identifier.citationCurrie, James D., and Jamie Simpson. “Non-Repetitive Tilings.”,Electronic Journal of Combinatorics 9(1) (2002): Research Paper #R28.en_US
dc.identifier.issn1077-8926
dc.identifier.urihttp://hdl.handle.net/10680/1347
dc.description.abstractIn 1906 Axel Thue showed how to construct an infinite non-repetitive (or square-free) word on an alphabet of size 3. Since then this result has been rediscovered many times and extended in many ways. We present a two-dimensional version of this result. We show how to construct a rectangular tiling of the plane using 5 symbols which has the property that lines of tiles which are horizontal, vertical or have slope +1 or −1 contain no repetitions. As part of the construction we introduce a new type of word, one that is non-repetitive up to mod k, which is of interest in itself. We also indicate how our results might be extended to higher dimensions.en_US
dc.description.urihttp://www.combinatorics.org/ojs/index.php/eljc/article/view/v9i1r28
dc.language.isoenen_US
dc.publisherThe Electronic Journal of Combinatoricsen_US
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleNon-Repetitive Tilingsen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record