On the minimal number of generators of endomorphism monoids of full shifts

Abstract

For a group G and a finite set A, denote by End(AG) the monoid of all continuous shift commuting self-maps of AG and by Aut(AG) its group of units. We study the minimal cardinality of a generating set, known as the rank, of End(AG) and Aut(AG). In the first part, when G is a finite group, we give upper and lower bounds for the rank of Aut(AG) in terms of the number of conjugacy classes of subgroups of G. In the second part, we apply our bounds to show that if G has an infinite descending chain of normal subgroups of finite index, then End(AG) is not finitely generated; such is the case for wide classes of infinite groups, such as infinite residually finite or infinite locally graded groups.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…