Statistical properties of subgroups of free groups

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations are determined) by randomly chosen k-tuples of reduced words, whose maximal length is allowed to tend to infinity. In this paper we adopt a different, though equally natural point of view: we investigate the statistical properties of the same objects, but with respect to the so-called graph-based distribution, recently introduced by Bassino, Nicaud and Weil. Here, subgroups (and finite presentations) are determined by randomly chosen Stallings graphs whose number of vertices tends to infinity. Our results show that these two distributions behave quite differently from each other, shedding a new light on which properties of finitely generated subgroups can be considered frequent or rare. For example, we show that malnormal subgroups of a free group are negligible in the graph-based distribution, while they are exponentially generic in the word-based distribution. Quite surprisingly, a random finite presentation generically presents the trivial group in this new distribution, while in the classical one it is known to generically present an infinite hyperbolic group.

[1]  Yann Ollivier,et al.  A January 2005 invitation to random groups , 2005, Ensaios Matemáticos.

[2]  Alexei G. Myasnikov,et al.  Malnormality is Decidable in Free Groups , 1999, Int. J. Algebra Comput..

[3]  Mark Sapir,et al.  ALMOST ALL ONE-RELATOR GROUPS WITH AT LEAST THREE GENERATORS ARE RESIDUALLY FINITE , 2008 .

[4]  A. Myasnikov,et al.  Group-based Cryptography , 2008 .

[5]  Ilya Kapovich,et al.  Generic-case complexity, decision problems in group theory and random walks , 2002, ArXiv.

[6]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[7]  Mark V. Sapir,et al.  Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata , 2001, Int. J. Algebra Comput..

[8]  Nicholas W. M. Touikan.  A Fast Algorithm for Stallings' Folding Process , 2006, Int. J. Algebra Comput..

[9]  P. Flajolet,et al.  Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[10]  Mark Sapir,et al.  Residual properties of 1-relator groups , 2010, 1001.2829.

[11]  Pascal Weil,et al.  Algebraic extensions in free groups , 2006, math/0610880.

[12]  Pascal Weil,et al.  Random Generation of Finitely Generated Subgroups of a Free Group , 2007, Int. J. Algebra Comput..

[13]  Igor Mineyev.  Submultiplicativity and the Hanna Neumann Conjecture , 2012 .

[14]  Ilya Kapovich,et al.  Stallings Foldings and Subgroups of Free Groups , 2002 .

[15]  Warren Dicks.  Equivalence of the strengthened Hanna Neumann conjecture and the amalgamated graph conjecture , 1994 .

[16]  Gerhard Rosenberger,et al.  MALNORMAL SUBGROUPS OF FREE GROUPS , 2002 .

[17]  Pascal Weil,et al.  PSPACE-complete problems for subgroups of free groups and inverse finite automata , 2000, Theor. Comput. Sci..

[18]  Kent,et al.  Intersections and joins of free groups , 2008 .

[19]  Steven A. Bleiler,et al.  The free product of groups with amalgamated subgroup malnormal in a single factor , 1998 .

[20]  Goulnara Arzhantseva,et al.  A property of subgroups of infinite index in a free group , 2000 .

[21]  C. Champetier,et al.  Statistical Properties of Groups with Finite Presentation , 1995 .

[22]  B. Everitt,et al.  Graphs, free groups and the Hanna Neumann conjecture , 2007, math/0701214.

[23]  Pascal Weil,et al.  On the Complexity of the Whitehead Minimization Problem , 2007, Int. J. Algebra Comput..

[24]  Pascal Weil,et al.  Subgroups of Free Groups: a Contribution to the Hanna Neumann Conjecture , 2002 .

[25]  Pascal Weil.  Computing Closures of Finitely Generated Subgroups of the Free Group , 2000 .

[26]  Albert Nijenhuis,et al.  Combinatorial Algorithms for Computers and Calculators , 1978 .

[27]  Robert G. Burns,et al.  On Finitely Generated Subgroups of Free Products , 1971, Journal of the Australian Mathematical Society.

[28]  Alvin Brown,et al.  Computers and Calculators , 2005 .

[29]  Igor Mineyev.  GROUPS, GRAPHS, AND THE HANNA NEUMANN CONJECTURE , 2012 .

[30]  John R. Stallings,et al.  Topology of finite graphs , 1983 .

[31]  A. Yu. Ol'shanskii.  Almost Every Group is hyperbolic , 1992, Int. J. Algebra Comput..

[32]  L. Comtet,et al.  Advanced Combinatorics: The Art of Finite and Infinite Expansions , 1974 .

[33]  A. Nijenhuis.  Combinatorial algorithms , 1975 .

[34]  Ilya Kapovich,et al.  Generic properties of Whitehead’s algorithm and isomorphism rigidity of random one-relator groups , 2003 .

[35]  A. O. Houcine.  On hyperbolic groups , 2006 .

[36]  Christophe Champetier.  Propriétés génériques des groupes de type fini , 1991 .

[37]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[38]  S. M. Gersten,et al.  Intersection of finitely generated subgroups of free groups and resolutions of graphs , 1983 .

[39]  D. B. McReynolds,et al.  Graphs of subgroups of free groups , 2009 .

[40]  A. Karrass,et al.  The Free Product of Two Groups with a Malnormal Amalgamated Subgroup , 1971, Canadian Journal of Mathematics.

[41]  Olga Kharlampovich,et al.  HYPERBOLIC GROUPS AND FREE CONSTRUCTIONS , 1996 .