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

DOI10.1007/S11047-020-09785-4OpenAlexW2977799525MaRDI QIDQ6155014FDOQ6155014

Authors Alonso Castillo-Ramirez

Publication date 16 February 2024

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.01081

zbMATH Keywords

automorphismscellular automataendomorphismsfull shiftminimal number of generators

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Group actions on combinatorial structures (05E18)

Abstract: For a group $G$ and a finite set $A$, denote by $extEnd(A^G)$ the monoid of all continuous shift commuting self-maps of $A^G$ and by $extAut(A^G)$ its group of units. We study the minimal cardinality of a generating set, known as the rank, of $extEnd(A^G)$ and $extAut(A^G)$. In the first part, when $G$ is a finite group, we give upper and lower bounds for the rank of $extAut(A^G)$ 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 $extEnd(A^G)$ is not finitely generated; such is the case for wide classes of infinite groups, such as infinite residually finite or infinite locally graded groups.

Recommendations

• Generating infinite monoids of cellular automata
• Bounding the minimal number of generators of groups and monoids of cellular automata
• A note on subgroups of automorphism groups of full shifts
• The relative rank of the endomorphism monoid of a finite \(G\)-set
• The rank of the endomorphism monoid of a uniform partition.

Cites work

• scientific article; zbMATH DE number 988693 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• An Introduction to Symbolic Dynamics and Coding
• Bounding the minimal number of generators of groups and monoids of cellular automata
• Cellular automata and groups
• Chains of subgroups in symmetric groups
• ENUMERATING FINITE GROUPS
• Fundamentals of Group Theory
• Locally graded groups with certain minimal conditions for subgroups. II
• On Finite Monoids of Cellular Automata
• On the ranks of certain finite semigroups of transformations
• Ranks of finite semigroups of one-dimensional cellular automata
• Subgroup growth.
• The Automorphism Group of a Shift of Finite Type
• The minimal number of generators of a finite semigroup.
• The rank of the endomorphism monoid of a uniform partition.
• Von Neumann regular cellular automata

Cited in

(1)

• Idempotent cellular automata and their natural order

This page was built for publication: On the minimal number of generators of endomorphism monoids of full shifts

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