Groupes à croissance polynomiale
Groupes aléatoires
Quelles sont les propriétés d’un groupe de présentation finie “tiré au hasard” ? La réponse à cette question dépend bien entendu de la méthode choisie pour le tirage au sort. On peut par exemple fixer générateurs et choisir relations aléatoirement parmi les mots de longueur , puis faire tendre vers l’infini. On peut aussi choisir un graphe fini, étiqueter aléatoirement ses arêtes par des générateurs, et considérer le groupe engendré par ces générateurs, soumis aux relations lues sur les cycles...
Groupes automatiques et courbure négative (d'après D.B.A. Epstein)
Groups generated by k-root subgroups.
Groups generated by k-transvections.
Groups generated by two mutually Engel periodic elements
Scriviamo ed . Cerchiamo gruppi con generatori tali che ed per alcuni numeri naturali , .
Groups in which certain equations have many solutions
Groups in which the derived groups of all 2-generator subgroups are cyclic
Groups of finite quasi-projective dimension.
Groups of given intermediate word growth
We show that there exists a finitely generated group of growth for all functions satisfying for all large enough and the positive root of . Set ; then all functions that grow uniformly faster than are realizable as the growth of a group.We also give a family of sum-contracting branched groups of growth for a dense set of .
Groups of piecewise linear homeomorphisms of the real line.
Groups of polynomial growth and expanding maps (with an appendix by Jacques Tits)
Groups of simple and multiple antisymmetry of borders.
Groups preserving the cardinality of subsets product under permutations
Groups with many nilpotent subgroups
Groups with One More Generator than Relators.
Groups with One More Generator than Relators.
Groups with root-system of type .
Growth functions and automatic groups.
Growth functions and Euler series.