Abstract
For a group G and a finite set A, denote by \(\mathrm{End}(A^G)\) the monoid of all continuous shift commuting self-maps of \(A^G\) and by \(\mathrm{Aut}(A^G)\) its group of units. We study the minimal cardinality of a generating set, known as the rank, of \(\mathrm{End}(A^G)\) and \(\mathrm{Aut}(A^G)\). In the first part, when G is a finite group, we give upper and lower bounds for the rank of \(\mathrm{Aut}(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 \(\mathrm{End}(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.
Similar content being viewed by others
References
Araújo J, Schneider C (2009) The rank of the endomorphism monoid of a uniform partition. Semigroup Forum 78:498–510
Boyle M, Lind D, Rudolph D (1988) The automorphism group of a shift of finite type. Trans Am Math Soc 306(1):71–114
Cameron PJ (1999) Permutation groups. London mathematical society student texts 45. Cambridge University Press, Cambridge
Cameron PJ, Solomon R, Turull A (1989) Chains of subgroups in symmetric groups. J. Algebra 127(2):340–352
Castillo-Ramirez A, Gadouleau M (2016) Ranks of finite semigroups of one-dimensional cellular automata. Semigroup Forum 93(2):347–362
Castillo-Ramirez A, Gadouleau M (2016) On finite monoids of cellular automata. In: Cook M, Neary T (eds) Cellular automata and discrete complex systems, vol 9664. LNCS. Springer, New York, pp 90–104
Castillo-Ramirez A, Gadouleau M (2017) Cellular automata and finite groups. Nat Comput (First Online)
Castillo-Ramirez A, Sanchez-Alvarez M (2019) Bounding the minimal number of generators of groups and monoids of cellular automata. In: Castillo-Ramirez A, de Oliveira P (eds) Cellular automata and discrete complex systems. AUTOMATA 2019, vol 11525. LNCS. Springer, Cham, pp 48–61
Ceccherini-Silberstein T, Coornaert M (2010) Cellular automata and groups. Springer monographs in mathematics. Springer, Berlin
Gomes GMS, Howie JM (1987) On the ranks of certain finite semigroups of transformations. Math Proc Camb Philos Soc 101:395–403
Gray RD (2014) The minimal number of generators of a finite semigroup. Semigroup Forum 89:135–154
Kim Y, Rhemtulla AH (1995) On locally graded groups. In: Groups—Korea (Pusan), vol 94. de Gruyter, Berlin, pp 189–197
Lind D, Marcus B (1995) An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge
Lubotzky A, Segal D (2003) Subgroup growth. Birkhäuser Verlag, Basel
McIver A, Neumann P (1987) Enumerating finite groups. Q J Math Oxf 38(4):473–488
Otal J, Peña JM (1988) Locally graded groups with certain minimal conditions for subgroups, II. Publicacions Mat 32:151–157
Roman S (2012) Fundamentals of group theory: an advanced approach. Springer, New York
Acknowledgements
Part of the research presented here was supported by a CONACYT Basic Science Grant (No. A1-S-8013) from the Government of Mexico.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Castillo-Ramirez, A. On the minimal number of generators of endomorphism monoids of full shifts. Nat Comput 21, 31–38 (2022). https://doi.org/10.1007/s11047-020-09785-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-020-09785-4