Growth of primitive elements in free groups.

From MaRDI portal



Abstract: In the free group Fk, 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 Noinfty). This also solves a question from the list `Open problems in combinatorial group theory' [Baumslag-Myasnikov-Shpilrain 02']. Let pk,N be the number of primitive words of length N in Fk. We show that for kge3, the exponential growth rate of pk,N is 2k3. Our proof also works for giving the exact growth rate of the larger class of elements belonging to a proper free factor.











This page was built for publication: Growth of primitive elements in free groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874650)