The number of configurations in the full shift with a given least period

Abstract

For any group G and any set A, consider the shift action of G on the full shift AG. A configuration x ∈ AG has least period H ≤ G if the stabiliser of x is precisely H. Among other things, the number of such configurations is interesting as it provides an upper bound for the size of the corresponding Aut(AG)-orbit. In this paper we show that if G is finitely generated and H is of finite index, then the number of configurations in AG with least period H may be computed using the M\"obius function of the lattice of subgroups of finite index in G. Moreover, when H is a normal subgroup, we classify all situations such that the number of G-orbits with least period H is at most 10.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…