Abstract
Let F k be the free group on k generators. A word w ∈ 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 ≤ J ≤ 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 ∈ F k 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 F k form a closed set in the profinite topology of free groups. Our results provide a positive answer for F 2.
Similar content being viewed by others
References
M. Abért, On the probability of satisfying a word in a group, Journal of Group Theory 9 (2006), 685–694.
O. Bogopolski, Introduction to Group Theory, EMS Textbooks in Mathematics, European Mathematical Society, Zürich, 2008.
S. M. Gersten, On Whitehead’s algorithm, Bulletin of the American Mathematical Society 10 (1984), 281–284.
S. Garion and A. Shalev, Commutator maps, measure preservation, and t-systems, Transactions of the American Mathematical Society 361 (2009), 4631–4651.
I. Kapovich and A. Myasnikov, Stallings foldings and subgroups of free groups, Journal of Algebra 248 (2002), 608–668.
N. Linial and D. Puder, Word maps and spectra of random graph lifts, Random Structures & Algorithms 37 (2010), 100–135.
R. C. Lyndon and P. E. Schupp, Combinatorial Group Theory, Springer-Verlag, Berlin-New York, 1970.
M. Larsen and A. Shalev, Characters of symmetric groups: sharp bounds and applications, Inventiones Mathematicae 174 (2008), 645–687.
M. Larsen and A. Shalev, Word maps and Waring type problems, Journal of the American Mathematical Society 22 (2009), 437–466.
A. Miasnikov, E. Ventura and P. Weil, Algebraic extensions in free groups, in Geometric Group Theory (G. N. Arzhantseva, L. Bartholdi, J. Burillo and E. Ventura, eds.), Trends in Mathematics, Birkhäuser, Basel, 2007, pp. 225–253.
A. Nica, On the number of cycles of given length of a free word in several random permutations, Random Structures & Algorithms 5 (1994), 703–730.
D. Puder and O. Parzanchevski, Measure preserving words are primitive, preprint, arXiv:1202.3269 (2012).
A. Roig, E. Ventura and P. Weil, On the complexity of the Whitehead minimization problem, International journal of Algebra and Computation 17 (2007), 1611–1634.
D. Segal, Words: Notes on Verbal Width in Groups, London Mathematical Society, Lecture Note Series, Vol. 361, Cambridge University Press, Cambridge, 2009.
A. Shalev, Word maps, conjugacy classes, and a non-commutative waring-type theorem, Annals of Mathematics 170 (2009), 1383–1416.
J. R. Stallings, Topology of finite graphs, Inventiones Mathematicae 71 (1983), 551–565.
J. R. Stallings, Whitehead graphs on handlebodies, in Geometric Group Theory Down Under (J. Cossey, C. F. Miller, W. D. Neumann and M. Shapiro, eds.), de Gruyter, Berlin, 1999, pp. 317–330.
P. Silva and P. Weil, On an algorithm to decide whether a free group is a free factor of another, Theoretical Informatics and Applications 42 (2008), 395–414.
J. H. C. Whitehead, On certain sets of elements in a free group, Proceedings of the London Mathematical Society 41 (1936), 48–56.
J. H. C. Whitehead, On equivalent sets of elements in a free group, Annals of Mathematics 37 (1936), 768–800.
J. S. Wilson, Profinite Groups, Clarendon Press, Oxford, 1998.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by Advanced ERC Grant 247034 of Aner Shalev, and by Adams Fellowship Program of the Israel Academy of Sciences and Humanities.
Rights and permissions
About this article
Cite this article
Puder, D. Primitive words, free factors and measure preservation. Isr. J. Math. 201, 25–73 (2014). https://doi.org/10.1007/s11856-013-0055-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-013-0055-2