proposed

approved

editing

proposed

The FST applies to a wide range of Cellular Automata. Wolfram's one-dimensional rule 90 gives the most elementary example where T_{oo} determines every ON cell. The tree structure T_{oo} also occurs with two -dimensional, accumulative, one-neighbor C.A. such as A151723, A319018, A147562. Also try: M={[0,1],[0,-1],[2,1],[-2,-1]}.

According to S. Ulam (Cfcf. Links), some version of the FST was already known to J. Holladay circa 1960.

The FST implies scale resonance between this cellular automaton and the arrowed half hexagon tiling (Cfcf. Links).

approved

editing

editing

approved

a(n) is to A151723(n+1) as A319018(n+1) is to A147562(n+1), n >= 0.

Also the number of ON cells after n generations in a knight's-move, one-neighbor, accumulative cellular automaton on the hexagonal lattice A_2. Define v(m)=2*sqrt(3)*[cos(m*Pi/3+Pi/6), sin(m*Pi/3+Pi/6)], vL(m)=2*v(m)+v(m+1), vR(m)=2*v(m)+v(m-1). The set of "knight's moves", M={vL(m):m=1,2,..6} U {vR(m):m=1,2,..6}, follows from an analogy between Z^2 and A_2. At each generation all ON cells remain ON while an OFF cell turns ON if and only if it has exactly one M-neighbor in the previous generation.

The FST applies here to 12 distinct wedges: with {v1,v2}={vL(m), vR(m)} or with (v1,v2)={vL(m), vR(m+1)}, and m=1,2,..6. The triangle inequality ensures that paths including other vectors can not cannot reach the front F_k by generation 2^k. However, other vectors do generate retrogressive growth, which turns ON many additional cells.

approved

editing

proposed

approved

editing

proposed

Fractal Structure Theorem (FST). Two A pair of lattice vectors M={v1 and ,v2 } generate a wedge, W = {x*v1 + y*v2 : x>=0, y>=0}. Define W-Subsets T_k such that T_{k+1}={ T_k} U { 2^n*v1 + v : v in T_k } U {2^n*v2 + v : v in T_k}, T_0 = { [0,0] }. The limit set T_{oo} is a fractal, and acquires the topology of a binary tree when points are connected by either v1 or v2. As a tree, T_k has height 2^k-1, with 2^k vertices at maximum depth, along a line in the direction v1-v2. Assume a one-M-neighbor, accumulative cellular automaton on W , where all vertices in T_k are ON. In the next generation, the front F_k={2^k*v1+m*(v2-v1) : 0<=m<=2^k} contains only two ON cells, {2^k*v1,2^k*v2}. The spacing, 2^k-1, is wide enough to turn ON two copies of T_k, one starting from each of the two ON cells in F_k. Thus T_{k+1} is also ON. Whenever only T_0 is ON as an initial condition, by induction, T_{oo} is ultimately ON.

According to S. Ulam (Cf. Links), some version of the FST was already known to J. Holladay circa 1960.

The FST implies scale "resonance" between this cellular automaton and the arrowed half hexagon tiling According to S. Ulam (Cf. Links), some version of the FST was already known to J. Holladay circa 1960.

The FST implies scale resonance between this cellular automaton and the arrowed half hexagon tiling (Cf. Links).

Hexagonal: A151723. Square: A319018, A147562. Tree: A006046, A267700, A038573. A322663.

proposed

editing

editing

proposed

a(n) is to a151723A151723(n+1) as a319018A319018(n+1) is to a147562A147562(n+1), n>=0.

Also the number of ON cells after n generations in a knight's-move, one-neighbor, accumulative cellular automaton on the hexagonal lattice A_2. Define v(m)=2*sqrt(3)*[cos(m*piPi/3+piPi/6),sin(m*piPi/3+piPi/6)], vL(m)=2*v(m)+v(m+1), vR(m)=2*v(m)+v(m-1). The set of "knight's moves", M={vL(m):m=1,2,..6} U {vR(m):m=1,2,..6}, follows from an analogy between Z^2 and A_2. At each generation all ON cells remain ON while an OFF cell turns ON if and only if it has exactly one M-neighbor in the previous generation.

The FST applies here to 12 distinct wedges: with {v1,v2}={vL(m) , , vR(m)} or with (v1,v2)={vL(m), vR(m+1)}, and m=1,2,..6. The triangle inequality ensures that paths including other vectors can not reach the front F_k by generation 2^k. However, other vectors do generate retrogressive growth, which turns ON many additional cells.

proposed

editing