Artificial intelligent assistant

Substitution scheme in Ammann–Beenker tiling On wiki page about Ammann–Beenker tiling is described the substitution scheme $R → R r R ; r → R$ that introduces the ratio as a scaling factor: its matrix is the Pell substitution matrix, and the series of words produced by the substitution have the property that the number of $r$s and $R$s are equal to successive Pell numbers. Q: the order of the $r$s and $R$s in the assignation $R → R r R ; r → R$ I don't understand. applying recursive definition of Pell numbers we see that in every recursion step if we associate $R_{old}:= P_n, r_{old}:=P_{n-1}$ then recursively we step forward by $R_{new}:=P_{n+1} = 2R_{old} +r_{old}$ and $r_{new}=R_{old}$. what I don't understand is the _order_ of $R$ and $r$ in the assignation $R → R r R$.

The substitution rule is to be understood as a combination of inflating (scaling) and replacement of patches.

r ->
R ->
RrR ->
(RrR)(R)(RrR) = RrRRRrR ->
(RrR)(R)(RrR)(RrR)(RrR)(R)(RrR) = RrRRRrRRrRRrRRRrR ->
etc.

Moreover you should be aware that this substitution only produces a 1D chain, while the Ammann-Beenker tiling clearly is 2D.

But clearly there is a 2D substitution too, which produces the required tiling directly. Again you have patches which are to be scaled first and then substituted by the original patches again. This then is described by the following Wikipedia picture: ![enter image description here](

\--- rk

xcX3v84RxoQ-4GxG32940ukFUIEgYdPy dfcca3ec7d44ab58a221e844810d4e15