David Fletcher | Search arXiv

arXiv2012

Construction of fixed points of certain substitution systems by interlacing arrays in 1 and 2 dimensions

This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form a new, more complex, infinite word. By considering particular limits of interlacings of words, fixed points of substitutions are generated. This method is then extended to two dimensions, where a structure equivalent to a well known aperiodic tiling (the Robinson tiling) is constructed.

math.DS↗

arXiv2010

Aperiodic tilings with one prototile and low complexity atlas matching rules

We give a constructive method that can decrease the number of prototiles needed to tile a space. We achieve this by exchanging edge to edge matching rules for a small atlas of permitted patches. This method is illustrated with Wang tiles, and we apply our method to present via these rules a single prototile that can only tile $R^3$ aperiodically, and a pair of square tiles that can only tile $R^2$ aperiodically.

math.CO↗