The Periodic Fingerprint

The automorphism group of a subshift — the set of all reversible, shift-commuting transformations of a symbolic dynamical system — encodes the symmetries of the system. For the full shift on n symbols, this group is enormous and poorly understood. For more structured subshifts, the automorphism group carries information about the system’s complexity. But which information?

Salo (arXiv:2603.16591) proves that the answer is periodic points. When totally periodic points are dense in a subshift, its automorphism group is residually finite — every non-identity element can be detected by a homomorphism to a finite group. The group, no matter how large or complicated, is determined by its finite quotients.

The partial converse is sharper: if periodic points are not dense, the automorphism group fails to be residually finite — and not subtly. For any subshift X lacking dense periodic points, the automorphism group of X × Y (the product with a full shift Y) contains elements that no finite group can detect. The non-identity element hides from every finite quotient.

This resolves an open question of Coornaert and Ceccherini-Silberstein by combining the result with Hochman’s construction of a strongly irreducible ℤ²-subshift containing no periodic points at all. The automorphism group of this subshift is not residually finite — a qualitative structural consequence of the complete absence of periodic orbits.

The structural lesson: periodic points are not just convenient computational tools for studying dynamical systems. They are the structural feature that determines whether the system’s symmetry group is “tame” (residually finite, detectable by finite approximations) or “wild” (containing symmetries invisible to any finite probe). The density of periodic orbits is an algebraic fingerprint of the dynamical system’s fundamental character.

Salo, “Periodic points and residual finiteness of automorphism groups of subshifts,” arXiv:2603.16591 (2026).