Ulam-Warburton Cellular Automaton

• UWCA is a discrete-time, outer-totalistic cellular automaton defined on an infinite square lattice with a single-neighbor birth rule that drives recursive growth.
• Its dynamics produce self-similar fractal boundaries and nested gradient profiles, revealing invariant geometric motifs and closed-form population laws.
• Variations in neighborhood templates demonstrate robust fractal dimensions and spectral properties, linking combinatorial behavior with applications in aperiodic material design.

The Ulam-Warburton Cellular Automaton (UWCA) is a discrete-time, outer-totalistic, single-neighbor birth automaton defined on the infinite two-dimensional square lattice. It is a paradigmatic system in the study of recursive growth, latent fractality, and algorithmic pattern formation, with significant connections to combinatorics, spectral graph theory, and aperiodic material design.

1. Formal Definition and Dynamics

Let $\mathbb{Z}^2$ be the infinite square grid. Each site $x \in \mathbb{Z}^2$ carries a Boolean state $C(x, n) \in \{0, 1\}$ at discrete generation $n \geq 0$, interpreted as "dead" ($0$) or "alive" ($1$). The neighborhood is von Neumann: for site $(i, j)$, neighbors are $(i \pm 1, j)$ and $(i, j \pm 1)$.

Initialization and Update Rule

• Initial configuration ($n = 0$): all $x \in \mathbb{Z}^2$0 except $x \in \mathbb{Z}^2$1 ("patriarch" at origin)
• For each $x \in \mathbb{Z}^2$2:
  • $x \in \mathbb{Z}^2$3 if $x \in \mathbb{Z}^2$4
  • $x \in \mathbb{Z}^2$5 if $x \in \mathbb{Z}^2$6 and exactly one neighbor $x \in \mathbb{Z}^2$7 has $x \in \mathbb{Z}^2$8
  • $x \in \mathbb{Z}^2$9 otherwise

Cells, once alive, remain so permanently ("no death"). This produces a deterministic, recursively propagating growth front.

2. Population Growth, Recurrence, and Fractal Dimension

Let $C(x, n) \in \{0, 1\}$0 denote the number of new cells born at generation $C(x, n) \in \{0, 1\}$1. The fundamental recursive description, following Applegate–Pol–Sloane, is: $C(x, n) \in \{0, 1\}$2 with $C(x, n) \in \{0, 1\}$3 and $C(x, n) \in \{0, 1\}$4 (Hao et al., 24 Jan 2026).

The total number of live cells through generation $C(x, n) \in \{0, 1\}$5 is $C(x, n) \in \{0, 1\}$6.

Closed-Form Population at Special Generations

At $C(x, n) \in \{0, 1\}$7, the pattern forms a perfect "diamond" of radius $C(x, n) \in \{0, 1\}$8. The total population: $C(x, n) \in \{0, 1\}$9 Each subsequent dyadic interval ($n \geq 0$0) corresponds to a self-similar recursive stage (Khovanova et al., 2014).

Fractal Dimension of the Boundary

The box-counting (Hausdorff) dimension $n \geq 0$1 of the pattern boundary at generation $n \geq 0$2 matches that of the Sierpiński triangle: $n \geq 0$3 This scaling arises because, in each quadrant, the birth pattern of "pioneer" cells reproduces the Sierpiński gasket (via Pascal's triangle mod 2 or binomial divisibility criterions) (Khovanova et al., 2014).

Away from special generations, the global pattern is less self-similar, but on averaging, the quadratic population law and Sierpiński-like slices persist (Hao et al., 24 Jan 2026, Warburton, 2019).

3. Recursive Gradient Profiling and Latent Self-Similarity

Binary (black/white) renderings of UWCA obscure its cumulative recursive order. The "Recursive Gradient Profile Function" (RGPF) systematically encodes the birth generation of each cell as a continuous intensity value: $n \geq 0$4 On each dyadic interval $n \geq 0$5, $n \geq 0$6 decreases linearly from 1 to 0, and this profile recurses at each scale (Hao et al., 24 Jan 2026).

Visualization Protocol:

• Assign to each cell born at generation $n \geq 0$7 a gray value $n \geq 0$8
• Accumulate these shades to draw the time-cumulative pattern

This approach produces visually nested terraces ("rings" or "layers") reflecting the automaton's arithmetic recursions. The darkest bands mark $n \geq 0$9—points of perfect square expansion. These terraces reveal geometric motifs invariant across scales that correspond to the pattern’s recursive construction.

Fractal analysis using Shifted Differential Box Counting (SDBC) of the $0$0 scalar field finds a robust fractal dimension $0$1 (fit error $0$2, normalized error $0$3), confirming persistent self-similarity in gradient-coded renderings across all generations (Hao et al., 24 Jan 2026).

4. Structural Variants and Universality of Recursive Fractality

The UWCA rule generalizes to a variety of neighborhood templates, all with the same "exactly one neighbor alive" birth rule:

Neighborhood	Fractal Dimension $0$4	Normalized Error $0$5
von Neumann (4-neighbor)	2.6827	0.112%
Moore (8-neighbor)	2.7072	0.116%
Moore + von Neumann (12-neigh.)	2.6519	0.116%
Displaced von Neumann	2.7150	0.120%
Cole neighborhood	2.6499	0.111%
Circular	2.7492	0.102%

All six variants generate distinct geometric patterns, but measured fractal dimensions remain in $0$6, with sub-0.12% fit errors for SDBC. This demonstrates that latent recursive fractality, as exposed by RGPF, is a robust emergent property in this class of automata (Hao et al., 24 Jan 2026).

5. Algebraic and Combinatorial Connections

Sierpiński Triangle and Pascal’s Triangle Modulo 2

Each quadrant of the UWCA pattern, when isolated, exactly reproduces the Sierpiński triangle via a lineage structure, where a "pioneer" is born in generation $0$7 at Manhattan distance $0$8 from the origin. The pioneer pattern corresponds to the entries of Pascal's triangle modulo 2: $0$9 (Khovanova et al., 2014).

Binary Expansion and Quadratic Counting

Letting $1$0 be as above (number of cells born at generation $1$1), for $1$2: $1$3 where $1$4 is the Hamming weight of $1$5. The total population up to generation $1$6: $1$7 For generations $1$8, $1$9 is a perfect quadratic: $(i, j)$0 with $(i, j)$1 (Warburton, 2019).

Nim Fractals

There is a direct isomorphism between three-pile Nim P-positions (with total counter $(i, j)$2) and the cells of a three-branch version of the UWCA. Specifically, the number of new P-positions at generation $(i, j)$3 is $(i, j)$4, and their evolution by bitwise manipulation mirrors the automaton's single-neighbor birth rule. Higher-pile generalizations lead to dimensional recurrences not captured by planar CA (Khovanova et al., 2014).

6. Physical Realizations and Spectral Properties

UWCA patterns, when used as templates for elastic lattices (with alive = unpinned, dead = pinned masses), produce aperiodic structures with unique mechanical and spectral properties:

• The stiffness matrix $(i, j)$5 (with $(i, j)$6, $(i, j)$7 adjacency) yields eigenfrequency spectra symmetric about the mean degree due to bipartiteness.
• Numerical simulations reveal repeated eigenvalues and strongly localized modes at "corners," corresponding to specific combinatorial junctions.
• The spectrum admits exactly solvable growth and corner-mode multiplicities, with pronounced features at generations $(i, j)$8, associated with $(i, j)$9-shaped motifs.
• Embedding active or gyroscopic elements enables the realization of directional states or topologically protected edge/corner phenomena (Ba'ba'a, 2024).

7. Broader Context and Implications

The recursive, scale-invariant structures revealed by RGPF in the UWCA are not only of mathematical interest but also resonate with cultural and optical motifs:

• Patterns evocative of infinity mirrors, video feedback, and "mise en abyme" are manifest in the gradient-terraformed visualizations.
• Architectural and religious fractals, including Sierpiński-like motifs, emerge naturally from the automaton's recursive law.
• The approach positions CA-based constructions as algorithmic sources for generative art and as "blueprints" for aperiodic, functionally engineered materials, suggesting programmable design routes for elastic metamaterials and waveguides (Hao et al., 24 Jan 2026, Ba'ba'a, 2024).

In summary, the Ulam-Warburton Cellular Automaton forms a cornerstone in discrete, self-similar growth, combining explicit algebraic recursion, fractal boundary emergence, robust spectral features, and latent recursive scaling revealed through gradient profile mapping across both mathematical and applied domains.