2011
DOI: 10.1090/s0002-9939-2011-10967-5
|View full text |Cite
|
Sign up to set email alerts
|

Bounding the residual finiteness of free groups

Abstract: Abstract. We find a lower bound to the size of finite groups detecting a given word in the free group. More precisely we construct a word w n of length n in non-abelian free groups with the property that w n is the identity on all finite quotients of size ∼ n 2/3 or less. This improves on a previous result of BouRabee and McReynolds quantifying the lower bound of the residual finiteness of free groups.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
38
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 30 publications
(40 citation statements)
references
References 7 publications
2
38
0
Order By: Relevance
“…The full residual finiteness growth of the discrete Heisenberg group is presented in [8]. Compare full residual finiteness growth to the concept of residual finiteness growth, which measures how well individual elements are detected by finite quotients, appearing in [5], [7], [3], [11], [18], [6], [12]. Also compare this with Sarah Black's growth function defined and studied in [2].…”
Section: Theorem 3 Let G Be a Finitely Generated Nilpotent Group Thmentioning
confidence: 99%
“…The full residual finiteness growth of the discrete Heisenberg group is presented in [8]. Compare full residual finiteness growth to the concept of residual finiteness growth, which measures how well individual elements are detected by finite quotients, appearing in [5], [7], [3], [11], [18], [6], [12]. Also compare this with Sarah Black's growth function defined and studied in [2].…”
Section: Theorem 3 Let G Be a Finitely Generated Nilpotent Group Thmentioning
confidence: 99%
“…Indeed with this analogy, Theorem 1.2 and the upper bound of n 3 established in [1], [11] can be viewed as a weak Prime Number Theorem for free groups since the Prime Number Theorem yields F Z (n) ≃ log(n). Recently, Kassabov-Matucci [8] improved the lower bound of n 1/3 to n 2/3 . A reasonable guess is that F F m ,X (n) ≃ n, though presently neither the upper or lower bound is known.…”
Section: Introductionmentioning
confidence: 99%
“…A reasonable guess is that F F m ,X (n) ≃ n, though presently neither the upper or lower bound is known. We refer the reader to [8] for additional questions and conjectures.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, several effective separability results have been established; see [2][3][4][5][6]8,9,[12][13][14][15][20][21][22][23]26]. Most relevant here are the papers [9,20] where bounds on the index of the separating subgroups for free and surface groups given.…”
Section: Introductionmentioning
confidence: 99%