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

From MaRDI portal
Publication:6360982




Abstract: For any group G and any set A, consider the shift action of G on the full shift AG. A configuration xinAG has emph{least period} HleqG 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 extAut(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.











This page was built for publication: The number of configurations in the full shift with a given least period

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6360982)