Abstract
In the group of infinite unitriangular matrices over the field with two elements, a free subgroup of rank two is constructed which is a group of finite-automata transformations over a two-element alphabet.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. C. Lyndon and P. E. Schupp,Combinatorial Group Theory, Springer-Verlag, New York-Heidelberg-Berlin (1977).
S. V. Aleshin, “A free group of finite automata,”Vestnik Moskov. Univ. Ser. I Mat. Mekh. [Moscow Univ. Math. Bull.], No. 4, 12–14 (1983).
A. Olijnyk, “Free products ofC 2 as groups of finitely automatic permutations,”Voprosy Algebry, No. 14, 158–165 (1999).
A. M. Brunner and S. Sidki, “The generation of GL(n, {ie324-1}) by finite state automata,”International Journal of Algebra and Computation,8, 127–139 (1998).
V. I. Sushchans’kii, “Groups of automata permutations,”Dopov. Nats. Akad. Nauk Ukr. Pat. Prirodozn. Tekhn. Nauki, No. 6, 47–51 (1998).
G. N. Raney, “Sequential functions,”J. Assoc. Comput. Math.,5, No. 2, 177–180 (1958).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 67, No. 3, pp. 382–386, March, 2000.
Rights and permissions
About this article
Cite this article
Oliinyk, A.S., Sushchanskii, V.I. Free group of infinite unitriangular matrices. Math Notes 67, 320–324 (2000). https://doi.org/10.1007/BF02676668
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02676668