Create a graph defined on all $(x,y)$ pairs for $x,y\in\mathbb Z$ as follows: $(x,y)$ is a coordinate pair referring to one vertex/node, all of which are laid out in a grid graph. Every vertex $(x,y)$ has an edge leading either north (up, $+y$) or west (left, $-x$). If $\gcd(x,y)=1$, that is, $x$ is coprime to…
Pure/simple x (0,0)-(260,260) Pure/simple x (-100,-100)-(100,100) Pure/simple x^2 – 1 (-120,-30)-(120,120) Pure/simple x^2 + 1(-120,-30)-(120,120)
(the new batch)
My response on this topic from a math.stackexchange post.
An attempted proof sketch for the total aperiodicity of the Rule 30 elementary cellular automaton.