Primitive words, free factors and measure preservation

By Doron Puder. 2011

62 citations recorded by the source corpus.

Let Fk be the free group on k generators. A word w ∈ Fk is called primitive if it belongs to some basis of Fk. We investigate two criteria for primitivity, and consider more generally subgroups of Fk which are free factors.The first criterion is graph-theoretic and uses Stallings core graphs: given subgroups of finite rank H ≤ J ≤ Fk 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 Fk is primitive.Again let w ∈ Fk and consider the word map w: G × … × G → 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 × … × 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 Fk form a closed set in the profinite topology of free groups. Our results provide a positive answer for F2.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/51178375b2820fc67f17e33e254c9ca5c5527f1e