Ulam–Warburton automaton
# Ulam–Warburton automaton

The Ulam–Warburton cellular automaton (UWCA) is a 2-dimensional fractal pattern that grows on a regular grid of cells consisting of squares. Starting with one square initially ON and all others OFF, successive iterations are generated by turning ON all squares that share precisely one edge with an ON square. This is the von Neumann neighborhood. The automaton is named after the Polish-American mathematician and scientist Stanislaw Ulam and the Scottish engineer, inventor and amateur mathematician Mike Warburton.

## Properties and relations

The UWCA is a 2D 5-neighbor outer totalistic cellular automaton using rule 686.

The number of cells turned ON in each iteration is denoted $u(n),$ with an explicit formula:

$u(0)=0,u(1)=1,$ and for $n\geq 2$

$u(n)=4\cdot 3^{wt(n-1)-1}$

where $wt(n)$ is the Hamming weight function which counts the number of 1's in the binary expansion of $n$

$wt(n)=n-\sum _{k=1}^{\infty }\left\lfloor {\frac {n}{2^{k}}}\right\rfloor$

The minimum upper bound of summation for $k$ is such that $2^{k}\geq n$

The total number of cells turned ON is denoted $U(n)$

$U(n)=\sum _{i\mathop {=} 0}^{n}u(i)={\frac {4}{3}}\sum _{i\mathop {=} 0}^{n-1}3^{wt(i)}-{\frac {1}{3}}$

### Table of wt(n), u(n) and U(n)

The table shows that different inputs to $wt(n)$ can lead to the same output.

This surjective property emerges from the simple rule of growth – a new cell is born if it shares only one-edge with an existing ON cell - the process appears disorderly and is modeled by functions involving $wt(n)$ but within the chaos there is regularity.

| $n$ | $wt(n)$ | $u(n)$ | $U(n)$ | $n$ | $wt(n)$ | $u(n)$ | $U(n)$ |
| - | - | - | - | - | - | - | - |
| 0 | 0 | 0 | 0 | 10 | 2 | 12 | 101 |
| 1 | 1 | 1 | 1 | 11 | 3 | 12 | 113 |
| 2 | 1 | 4 | 5 | 12 | 2 | 36 | 149 |
| 3 | 2 | 4 | 9 | 13 | 3 | 12 | 161 |
| 4 | 1 | 12 | 21 | 14 | 3 | 36 | 197 |
| 5 | 2 | 4 | 25 | 15 | 4 | 36 | 233 |
| 6 | 2 | 12 | 37 | 16 | 1 | 108 | 341 |
| 7 | 3 | 12 | 49 | 17 | 2 | 4 | 345 |
| 8 | 1 | 36 | 85 | 18 | 2 | 12 | 357 |
| 9 | 2 | 4 | 89 | 19 | 3 | 12 | 369 |

$U(n)$ is OEIS sequence A147562 and $u(n)$ is OEIS sequence A147582

### Counting cells with quadratics

For all integer sequences of the form $n_{m}=m\cdot 2^{k}$ where $m\geq 1$ and $k\geq 0$

Let

$a_{m}=\sum _{i\mathop {=} 0}^{m-1}3^{wt(i)}$

($a_{m}$ is OEIS sequence A130665)

Then the total number of ON cells in the integer sequence $n_{m}$ is given by

$U_{m}(n_{m})={\frac {a_{m}}{m^{2}}}{\frac {4}{3}}n_{m}^{2}-{\frac {1}{3}}$

Or in terms of $k$ we have

$U_{m}(k)=a_{m}{\frac {4}{3}}2^{2k}-{\frac {1}{3}}$

### Table of integer sequences $n_m$ and $U_m$

| $k$ | $n_{1}$ | $U_{1}$ | $n_{3}$ | $U_{3}$ | $n_{5}$ | $U_{5}$ | $n_{7}$ | $U_{7}$ |
| - | - | - | - | - | - | - | - | - |
| 0 | 1 | 1 | 3 | 9 | 5 | 25 | 7 | 49 |
| 1 | 2 | 5 | 6 | 37 | 10 | 101 | 14 | 197 |
| 2 | 4 | 21 | 12 | 149 | 20 | 405 | 28 | 789 |
| 3 | 8 | 85 | 24 | 597 | 40 | 1,621 | 56 | 3,157 |
| 4 | 16 | 341 | 48 | 2,389 | 80 | 6,485 | 112 | 12,629 |
| 5 | 32 | 1,365 | 96 | 9,557 | 160 | 25,941 | 224 | 50,517 |

## Upper and lower bounds

$U(n)$ has fractal-like behavior with a sharp upper bound for $n\geq 1$ given by

    $U_{\text{sub}}(n)={\frac {4}{3}}n^{2}-{\frac {1}{3}}$

The upper bound only contacts $U(n)$ at 'high-water' points when $n=2^{k}$.

These are also the generations at which the UWCA based on squares, the Hex–UWCA based on hexagons and the Sierpinski triangle return to their base shape.

### Limit superior and limit inferior

We have

    $0.9026116569...=\liminf _{n\to \infty }{\frac {U(n)}{n^{2}}}<\limsup _{n\to \infty }{\frac {U(n)}{n^{2}}}={\frac {4}{3}}$

The lower limit was obtained by Robert Price (OEIS sequence A261313 ) and took several weeks to compute and is believed to be twice the lower limit of ${\frac {T(n)}{n^{2}}}$ where $T(n)$ is the total number of toothpicks in the toothpick sequence up to generation $n$

## Relationship to

### Hexagonal UWCA

The Hexagonal-Ulam–Warburton cellular automaton (Hex-UWCA) is a 2-dimensional fractal pattern that grows on a regular grid of cells consisting of hexagons. The same growth rule for the UWCA applies and the pattern returns to a hexagon in generations $n=2^{k}$, when the first hexagon is considered as generation $1$. The UWCA has two reflection lines that pass through the corners of the initial cell dividing the square into four quadrants, similarly the Hex-UWCA has three reflection lines dividing the hexagon into six sections and the growth rule follows the symmetries. Cells whose centers lie on a line of reflection symmetry are never born.

The Hex-UWCA pattern can be explored here.

### Sierpinski triangle

The Sierpinski triangle appears in 13th century Italian floor mosaics. Wacław Sierpiński described the triangle in 1915.

If we consider the growth of the triangle, with each row corresponding to a generation and the top row generation $1$ is a single triangle, then like the UWCA and the Hex-UWCA it returns to its starting shape, in generations $n=2^{k}.$

### Toothpick sequence

The toothpick pattern is constructed by placing a single toothpick of unit length on a square grid, aligned with the vertical axis. At each subsequent stage, for every exposed toothpick end, place a perpendicular toothpick centred at that end. The resulting structure has a fractal-like appearance.

The toothpick and UWCA structures are examples of cellular automata defined on a graph and when considered as a subgraph of the infinite square grid the structure is a tree.

The toothpick sequence returns to its base rotated ‘H’ shape in generations $n=2^{k}$ where $k\geq 1$

The toothpick sequence and various toothpick-like sequences can be explored here.

### Combinatorial game theory

A subtraction game called LIM, in which two players alternately modify three piles of tokens by taking an equal amount of tokens from two of the piles and adding the same amount to the third pile, has a set of winning positions that can be described using the Ulam–Warburton automaton.

## History

The beginnings of automata go back to a conversation Ulam had with Stanislaw Mazur in a coffee house in Lwów Poland when Ulam was twenty in 1929. Ulam worked with John von Neumann during the war years when they became good friends and discussed cellular automaton. Von Neumann’s used these ideas in his concept of a universal constructor and the digital computer. Ulam focussed on biological and ‘crystal like’ patterns publishing a sketch of the growth of a square based cell structure using a simple rule in 1962. Mike Warburton is an amateur mathematician working in probabilistic number theory who was educated at George Heriot's School in Edinburgh. His son's mathematics GCSE coursework involved investigating the growth of equilateral triangles or squares in the Euclidean plane with the rule – a new generation is born if and only if connected to the last by only one-edge. That coursework concluded with a recursive formula for the number of ON cells born in each generation. Later, Warburton found the sharp upper bound formula which he wrote up as a note in the Open University’s M500 magazine in 2002. David Singmaster read the article, analysed the structure and named the object the Ulam-Warburton cellular automaton in his 2003 article. Since then it has given rise to numerous integer sequences.

