The class of groups all of whose subgroups with lesser number of generators are free is generic
Matematičeskie zametki, Tome 59 (1996) no. 4, pp. 489-496
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
It is shown that, in a certain statistical sense, in almost every group with $m$ generators and $n$ relations (with $m$ and $n$ chosen), any subgroup generated by less than $m$ 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.
[1] Guba V. S., “Ob usloviyakh, pri kotorykh 2-porozhdennye podgruppy v gruppakh s malym sokrascheniem svobodny”, Izv. vuzov. Matem., 1986, no. 7, 12–19 | MR | Zbl
[2] Kourovskaya tetrad. (Nereshennye voprosy teorii grupp), 11-e izd., Nauka, Novosibirsk, 1990
[3] Margolis S. W., Meakin J. C., “Free inverse monoids and graph immersions”, Int. J. Algebra and Comput., 3:1 (1993), 79–100 | DOI | MR
[4] Lindon R., Shupp P., Kombinatornaya teoriya grupp, Mir, M., 1980