OCA talk:Rule 120
Revision as of 16:04, 20 July 2024 by DroneBetter (talk | contribs) (add small note about periods in cyclic tapes)
how is this different from sierpinski apart from the fact its tilted a bit tommyaweosme 21:17, 14 May 2024 (UTC)
- it isn't a tilted Sierpinski (the only rules that do form it are the set of equivalence classes {(26,82),(60,102),(154,120,166,180),(18),(22),(90),(126),(146,182)}), the Sierpinski triangle that they approach can be defined as the limit S∞ of a sequence of shapes where S0 = {(0,0)} and Si+1 = Si ∪ {(x,y+2i): x,y ∈ Si} ∪ {(x-2i,y+2i): x,y ∈ Si}; as such it triples in size for each doubling in length, so has fractal dimension log2(3)
| (click above to open LifeViewer) |
- whereas the fractal this one approaches (if one ignores the lines that form an asymptotically infinitesimal proportion of its total "area") instead displaces each copy of Si by (0,0),(0,4i),(0,2*4i),(0,3*4i),(-2i,3*4i), so has a fractal dimension of log2(5) with respect to x and of log4(5) with respect to y (so I suppose one could describe it as log√8(5)-dimensional with respect to area)
| (click above to open LifeViewer) |
- in general, the nth rule's fractal is logb(2n+1), where b=2 is horizontal, b=2n is vertical and b=2n+12 is areawiise
- also note, I intend to either rewrite much of this page or maybe upload the LaTeX writeup I've been working on, in which I have proven considerably more than is explained here, but that led to further questions that I have not yet answered, but feel would be necessary before it may be published. DroneBetter (talk) 23:02, 14 May 2024 (UTC)
cyclic tapes: single cell's period is not maximal
A small note for future investigators:
from dronery import* cycshift=λ l,s,i: (s<<i%l|s>>(l-i%l))&~(~0<<l) lexmin=λ l,s: min(map(λ i: cycshift(l,s,i),range(l))) oscs=Y(λ f: λ o,i: λ t: (f(o[:-1]+((n,),),n+1)(t) if (n:=next(filter(λ i: not any(map(rcontains(i),o)),range(i,len(t))),-1))>=0 else o[:-1]) if o[-1]==() else f(o[:-1]+(o[-1]+(n,),()) if (n:=t[o[-1][-1]]) in o[-1] else o[:-1]+(o[-1]+(n,),),i)(t))(((),),0) m=0 #depending on whether cyclically-shifted states are equivalent print(stratrix(tap(λ n: sorted(sap(λ o: len(o)+~o.index(o[-1]),oscs(tap(λ s: (λ s: lexmin(n,s) if m else s)(s^cycshift(n,s,1)&cycshift(n,s,2)),range(1<<n))))),range(2,12)),dims=2))
one obtains tables of possible periods
wid| ordinary | cyclic 1 | 1 | 1 2 | 1 | 1 3 | 1 | 1 4 | 1, 4 | 1 5 | 1, 15 | 1, 3 6 | 1 | 1 7 | 1, 49 | 1, 7 8 | 1, 4,120 | 1,15 9 | 1, 9, 54 | 1,18 10 | 1, 15,410 | 1, 3,41 11 | 1,176 | 1,16 12 | 1, 4, 56, 60 | 1, 5,28 13 | 1, 10, 26,143,403,416 | 1, 2,10,11,31,32
the maxima go
n|1,2,3,4, 5,6, 7, 8, 9, 10, 11,12, 13
cyclic|1,1,1,1, 3,1, 7, 15,18, 41, 16,28, 32
ordinary|1,1,1,4,15,1,49,120,54,410,176,60,416
A334505|1,1,1,2,15,1,49, 15,54,205,176, 1,403
(with A334505 being the eventual period of a single cell in an n-cell universe which is cyclic but not invariant under cyclic shift)
so the easy-to-conjecture idea that a single cell always becomes a maximal-period oscillator for odd n breaks down at n=13