Local Factor Rigidity and Mass–Defect Bounds for Langton’s Ant

Hao Ke

Preprint ·

Abstract

Can the short turn patterns of a highway force a Langton ant to follow that highway? We call a ten-turn window legal when it occurs in the standard 104-turn highway word, read cyclically. If every future window is legal and the initial colouring has m black cells, the ant reaches the standard highway within 12m + 212 updates. The coefficient 12 is optimal. For trajectories from any finite black set, the same language measures departures from highway behaviour. Writing B_t for the black cells at time t and N₁₀(s, t) for the illegal windows wholly contained in [s, t), we prove 3(t − s) − 26(|B_t|−|B_s|) ≤ 351N₁₀(s, t) + 322. Thus a trajectory with few illegal windows must create black cells at nearly the highway rate. The additive constant 322 and the asymptotic mass-growth slope are sharp. The attraction proof excludes arbitrarily repeated folds in a finite graph of physically feasible words. The mass inequality uses a separate finite-word potential and applies even to fragments with no infinite legal continuation. We also compute the next illegal window and its complete output state, describe the geometry of finite legal intervals, and show that nine is the least window length giving a uniform legal-word mass-deficit bound.

Citation

Hao Ke (2026). Local Factor Rigidity and Mass–Defect Bounds for Langton’s Ant. Zenodo. 10.5281/zenodo.23675965

@misc{ke2026langtonsantfactors,
  author = {Hao Ke},
  title = {{Local Factor Rigidity and Mass–Defect Bounds for Langton’s Ant}},
  year = {2026},
  doi = {10.5281/zenodo.23675965},
  url = {https://doi.org/10.5281/zenodo.23675965},
  note = {Preprint, version 0.1.1}
}

CC BY 4.0.