## Abstract

In the free group F-{k}, an element is said to be primitive if it belongs to a free generating set. In this paper, we describe what a generic primitive element looks like. We prove that up to conjugation, a random primitive word of length N contains one of the letters exactly once asymptotically almost surely (as N\to \infty). This also solves a question raised by Baumslag-Myasnikov- Shpilrain (Contemp. Math. 296 (2002) 1-38). Let p-{k,N} be the number of primitive words of length N in F-{k}. We show that for k\geq 3, the exponential growth rate of p-{k,N} is 2k-3. Our proof also works for giving the exact growth rate of the larger class of elements belonging to a proper free factor.

Original language | English |
---|---|

Pages (from-to) | 89-104 |

Number of pages | 16 |

Journal | Journal of the London Mathematical Society |

Volume | 90 |

Issue number | 1 |

DOIs | |

State | Published - Aug 2014 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- General Mathematics