Abstract
It is shown that, in a certain statistical sense, in almost every group withm generators andn relations (withm andn chosen), any subgroup generated by less thanm elements (which need not belong to the system of generators of the whole group) is free. In particular, this solves Problem 11.75 from the Kourov Notebook. In the proof we introduce a new assumption on the defining relations stated in terms of finite marked groups.
Similar content being viewed by others
References
V. S. Guba, “Conditions under which 2-generated groups in small cancellation groups are free,”Izv. Vyssh. Uchebn. Zaved. Mat., [Soviet Math. J. (Iz. VUZ)], No. 7, 12–19 (1986).
Kourov Notebook. (Unsolved Problems of Group Theory) [in Russian], 11th ed., Nauka, Novosibirsk (1990).
S. W. Margolis and J. C. Meakin, “Free inverse monoids and graph immersions,”Int. J. Algebra and Comput. 3, No. 1, 79–100 (1993).
Roger C. Lyndon and Paul E. Shupp,Combinatorial Group Theory, Springer-Verlag, Berlin-Heidelberg-New York (1977).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 59, No. 4, pp. 489–496, April, 1996.
The research of the second author was partially supported by the Russian Foundation for Basic Research under grant No. 94-0101541 and by the International Science Foundation under grant No. MID000.
Rights and permissions
About this article
Cite this article
Arzhantseva, G.N., Ol'shanskii, A.Y. The class of groups all of whose subgroups with lesser number of generators are free is generic. Math Notes 59, 350–355 (1996). https://doi.org/10.1007/BF02308683
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02308683