2015
DOI: 10.5802/aif.2984
|View full text |Cite
|
Sign up to set email alerts
|

Ordering the space of finitely generated groups

Abstract: We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in (G,S_i) and in (H,T) coincide. Given a nilpotent group G, we characterize its connected component in this graph: if that connected component contains at least one torsion-free group, then it consists of those groups which generate the same variety of groups as G. The arro… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(29 citation statements)
references
References 46 publications
0
29
0
Order By: Relevance
“…Remark 5.5. The proof of Proposition 5.4(d) actually shows that for all k, G has a generating set with n elements and no simple cycles of length ≤ k, where n is independent of k. This is equivalent to G preforming the free group F n in the language of [6] and to G being without almost-identities in the language of [47]. However, it is unclear if this is actually stronger then the property of infinite girth (see [6,Question 8.5]).…”
Section: Graph Productsmentioning
confidence: 97%
See 1 more Smart Citation
“…Remark 5.5. The proof of Proposition 5.4(d) actually shows that for all k, G has a generating set with n elements and no simple cycles of length ≤ k, where n is independent of k. This is equivalent to G preforming the free group F n in the language of [6] and to G being without almost-identities in the language of [47]. However, it is unclear if this is actually stronger then the property of infinite girth (see [6,Question 8.5]).…”
Section: Graph Productsmentioning
confidence: 97%
“…, a n of G * x , so we obtain that G * x has finite girth. However this is well-known to be false (for example, see [6,Example 2.15]).…”
Section: Graph Productsmentioning
confidence: 99%
“…Therefore, by the aforementioned result in [BE15], the group H 3 ≀ Z, which is amenable, admits a sequence of markings (S m ) m with respect to which the marked groups converge to some (non-abelian) free marked group F k . By Theorem A, the disjoint union m Cay(H 3 ≀ Z; S m ) does not have property A.…”
Section: Examples To Apply Theorem a We Here Exhibit Several Examplementioning
confidence: 88%
“…It implies that it is sometimes much easier to construct an LEF group with specified property than to obtain such an RF group; compare with Remark . The LEF property for finitely generated groups is closed under taking standard (restricted) wreath products ; see Lemma . This provides us room that suffices to apply variants of Hall's embedding argument ([, 1.5]) and of the absorption trick ([, Lemma 6.13]). The former is employed to reduce the number of generators to 2; the latter is used to construct two system of markings of a fixed sequence of finite groups that have considerably different behaviors at the Cayley limits (see Step 3 in the outlined proof of Theorem below).…”
Section: Strategy Of the Proof Of Theorem  And Organization Of This Pmentioning
confidence: 99%
“…This trick was at least observed in a work of Bartholdi and Erschler. We exhibit a form of the absorption trick, which is easily deduced from [, Lemma 6.13]. Lemma Let kdouble-struckN1.…”
Section: Proof Of Theoremmentioning
confidence: 99%