Primitive words, free factors and measure preservation. (Q466065): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Let \(F_k\) be the free group on \(k\) generators. An element \(w\in F_k\) is primitive if it belongs to some basis of \(F_k\); a subgroup \(H\leq F_k\) is a free factor of \(F_k\) if there is another group \(H'\) such that \(H*H'=F_k\). The first main theorem gives a graph theoretic condition for a finitely generated subgroup \(H\) of \(F_k\) to be a free factor of another such group \(J\). Namely, that in a particular graph (defined in terms of core graphs) the distance between vertices corresponding to \(H\) and \(J\) is equal to the difference in their ranks. Since this distance can be explicitly computed, the theorem provides an algorithm (given in an appendix) for determining if \(H\) is a free factor of \(J\) and which, in particular, can be used to detect primitive words. An element \(w\in F_k\) (resp. finitely generated subgroup \(H\) of \(F_k\)) is measure preserving if for every finite group \(G\) and every homomorphism \(\alpha_G\in\Hom(F_k,G)\) chosen uniformly at random we have that \(\alpha_G(w)\) (resp. \(\alpha_G|_H\)) is uniformly distributed over \(G\) (resp. in \(\Hom(H,G)\)). Various authors have made the following conjecture: (i) for any finitely generated subgroup \(H\) of \(F_k\), \(H\) is a free factor of \(F_k\) if and only if \(H\) is measure preserving; (ii) in particular, for every \(w\in F_k\), \(w\) is primitive if and only if \(w\) is measure preserving. The second main theorem supports this conjecture. Specifically, it proves part (i) when \(H\) has rank at least \(k-1\) and proves (ii) for \(k=2\). The proof relies on the first main theorem. A corollary is that the set of primitive elements in \(F_2\) is closed in the profinite topology. It is mentioned that the method of proof of the second main theorem may be powerful enough to prove the conjecture in its entirety, and that has since been shown to be the case: the article [\textit{D. Puder} and \textit{O. Parzanchevski}, J. Am. Math. Soc. 28, No. 1, 63-97 (2015; Zbl 1402.20042)] proves the conjecture using this approach. | |||
Property / review text: Let \(F_k\) be the free group on \(k\) generators. An element \(w\in F_k\) is primitive if it belongs to some basis of \(F_k\); a subgroup \(H\leq F_k\) is a free factor of \(F_k\) if there is another group \(H'\) such that \(H*H'=F_k\). The first main theorem gives a graph theoretic condition for a finitely generated subgroup \(H\) of \(F_k\) to be a free factor of another such group \(J\). Namely, that in a particular graph (defined in terms of core graphs) the distance between vertices corresponding to \(H\) and \(J\) is equal to the difference in their ranks. Since this distance can be explicitly computed, the theorem provides an algorithm (given in an appendix) for determining if \(H\) is a free factor of \(J\) and which, in particular, can be used to detect primitive words. An element \(w\in F_k\) (resp. finitely generated subgroup \(H\) of \(F_k\)) is measure preserving if for every finite group \(G\) and every homomorphism \(\alpha_G\in\Hom(F_k,G)\) chosen uniformly at random we have that \(\alpha_G(w)\) (resp. \(\alpha_G|_H\)) is uniformly distributed over \(G\) (resp. in \(\Hom(H,G)\)). Various authors have made the following conjecture: (i) for any finitely generated subgroup \(H\) of \(F_k\), \(H\) is a free factor of \(F_k\) if and only if \(H\) is measure preserving; (ii) in particular, for every \(w\in F_k\), \(w\) is primitive if and only if \(w\) is measure preserving. The second main theorem supports this conjecture. Specifically, it proves part (i) when \(H\) has rank at least \(k-1\) and proves (ii) for \(k=2\). The proof relies on the first main theorem. A corollary is that the set of primitive elements in \(F_2\) is closed in the profinite topology. It is mentioned that the method of proof of the second main theorem may be powerful enough to prove the conjecture in its entirety, and that has since been shown to be the case: the article [\textit{D. Puder} and \textit{O. Parzanchevski}, J. Am. Math. Soc. 28, No. 1, 63-97 (2015; Zbl 1402.20042)] proves the conjecture using this approach. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20E05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20F10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A16 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20F69 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20F05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20E18 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6361293 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
free groups | |||
Property / zbMATH Keywords: free groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
primitive elements | |||
Property / zbMATH Keywords: primitive elements / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
free factors | |||
Property / zbMATH Keywords: free factors / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
measure preserving elements | |||
Property / zbMATH Keywords: measure preserving elements / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
core graphs | |||
Property / zbMATH Keywords: core graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finitely generated subgroups | |||
Property / zbMATH Keywords: finitely generated subgroups / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Alun G. T. Williams / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3102790340 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1104.3991 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the probability of satisfying a word in a group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Introduction to group theory. Translated from the Russian. With a new chapter. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Whitehead’s algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Commutator maps, measure preservation, and 𝑇-systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stallings foldings and subgroups of free groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Word maps and spectra of random graph lifts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial group theory. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characters of symmetric groups: sharp bounds and applications. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Word maps and Waring type problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3525453 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of cycles of given length of a free word in several random permutations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Measure preserving words are primitive / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5193150 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Word maps, conjugacy classes, and a noncommutative Waring-type theorem. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology of finite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263829 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On an algorithm to decide whether a free group is a free factor of another / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4217279 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:47, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Primitive words, free factors and measure preservation. |
scientific article |
Statements
Primitive words, free factors and measure preservation. (English)
0 references
24 October 2014
0 references
Let \(F_k\) be the free group on \(k\) generators. An element \(w\in F_k\) is primitive if it belongs to some basis of \(F_k\); a subgroup \(H\leq F_k\) is a free factor of \(F_k\) if there is another group \(H'\) such that \(H*H'=F_k\). The first main theorem gives a graph theoretic condition for a finitely generated subgroup \(H\) of \(F_k\) to be a free factor of another such group \(J\). Namely, that in a particular graph (defined in terms of core graphs) the distance between vertices corresponding to \(H\) and \(J\) is equal to the difference in their ranks. Since this distance can be explicitly computed, the theorem provides an algorithm (given in an appendix) for determining if \(H\) is a free factor of \(J\) and which, in particular, can be used to detect primitive words. An element \(w\in F_k\) (resp. finitely generated subgroup \(H\) of \(F_k\)) is measure preserving if for every finite group \(G\) and every homomorphism \(\alpha_G\in\Hom(F_k,G)\) chosen uniformly at random we have that \(\alpha_G(w)\) (resp. \(\alpha_G|_H\)) is uniformly distributed over \(G\) (resp. in \(\Hom(H,G)\)). Various authors have made the following conjecture: (i) for any finitely generated subgroup \(H\) of \(F_k\), \(H\) is a free factor of \(F_k\) if and only if \(H\) is measure preserving; (ii) in particular, for every \(w\in F_k\), \(w\) is primitive if and only if \(w\) is measure preserving. The second main theorem supports this conjecture. Specifically, it proves part (i) when \(H\) has rank at least \(k-1\) and proves (ii) for \(k=2\). The proof relies on the first main theorem. A corollary is that the set of primitive elements in \(F_2\) is closed in the profinite topology. It is mentioned that the method of proof of the second main theorem may be powerful enough to prove the conjecture in its entirety, and that has since been shown to be the case: the article [\textit{D. Puder} and \textit{O. Parzanchevski}, J. Am. Math. Soc. 28, No. 1, 63-97 (2015; Zbl 1402.20042)] proves the conjecture using this approach.
0 references
free groups
0 references
primitive elements
0 references
free factors
0 references
measure preserving elements
0 references
core graphs
0 references
finitely generated subgroups
0 references