Primitive Words, Free Factors and Measure Preservation

Abstract

Let F_k be the free group on k generators. A word w \in F_k is called primitive if it belongs to some basis of F_k. We investigate two criteria for primitivity, and consider more generally, subgroups of F_k which are free factors. The first criterion is graph-theoretic and uses Stallings core graphs: given subgroups of finite rank H \le J \le F_k we present a simple procedure to determine whether H is a free factor of J. This yields, in particular, a procedure to determine whether a given element in F_k is primitive. Again let w \in F_k and consider the word map w:G x G x ... x G \to G (from the direct product of k copies of G to G), where G is an arbitrary finite group. We call w measure preserving if given uniform measure on G x G x ... x G, w induces uniform measure on G (for every finite G). This is the second criterion we investigate: it is not hard to see that primitivity implies measure preservation and it was conjectured that the two properties are equivalent. Our combinatorial approach to primitivity allows us to make progress on this problem and in particular prove the conjecture for k=2. It was asked whether the primitive elements of F_k form a closed set in the profinite topology of free groups. Our results provide a positive answer for F_2.

This is a unified version of two manuscripts: "On Primitive words I: A New Algorithm", and "On Primitive Words II: Measure Preservation". 42 pages, 14 figures. Some parts of the paper reorganized towards publication in the Israel J. of Math

Cited by in corpus (14)

• Expansion of Random Graphs: New Proofs, New Results
• Measure Preserving Words are Primitive
• A random cover of a compact hyperbolic surface has relative spectral gap $\frac{3}{16}-\epsilon$
• Matrix Group Integrals, Surfaces, and Mapping Class Groups I: $U(n)$
• Word Measures on Symmetric Groups
• Growth of Primitive Elements in Free Groups
• Some Orbits of Free Words that are Determined by Measures on Finite Groups
• A Note on the Trace Method for Random Regular Graphs
• Short, highly imprimitive words yield hyperbolic one-relator groups
• Surface Words are Determined by Word Measures on Groups
• Core Surfaces
• Word Measures on $G{L}_N(q)$ and Free Group Algebras
• Ideals of equations for elements in a free group and Stallings folding
• Onto extensions of free groups