Corpus ID: 235446671

Amenability and profinite completions of finitely generated groups

@inproceedings{Kionke2021AmenabilityAP,
  title={Amenability and profinite completions of finitely generated groups},
  author={Steffen Kionke and E. Schesler},
  year={2021}
}
This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group A and an uncountable family of finitely generated, residually finite non-amenable groups all of which are profinitely isomorphic to A. All of these groups are branch groups. Moreover, picking up Grothendieck’s problem, the group A embeds in these groups such that the inclusion induces… Expand

References

SHOWING 1-10 OF 28 REFERENCES
Maximal subgroups in finite and profinite groups
We prove that if a finitely generated profinite group G is not generated with positive probability by finitely many random elements, then every finite group F is obtained as a quotient of an openExpand
GROTHENDIECK'S PROBLEMS CONCERNING PROFINITE COMPLETIONS AND REPRESENTATIONS OF GROUPS
In 1970 Alexander Grothendieck [6] posed the following problem: let Γ1 and Γ2 be finitely presented, residually finite groups, and let u :Γ 1 → Γ2 be a homomorphism such that the induced map ofExpand
Representations lineaires et compactification profinie des groupes discrets
The main result asserts that if u: G→H is a morphism of discrete groups of finite type such that the extension û:Ĝ→Ĥ of u to the profinite completions is an isomorphism, then the theory of linearExpand
Positively finitely generated groups
The title refers to groups in which, picking a finite subset at random, the probability that this subset generates the group is positive. We show that soluble groups, the groups SL(fc, Z) (k > 3),Expand
Uniform non-amenability of free Burnside groups
Abstract.The aim of this paper is to show that free Burnside groups of sufficiently large odd exponent are non-amenable in a certain strong sense. More precisely their left regular representationsExpand
Groups of intermediate subgroup growth and a problem of Grothendieck
Let f be a function such that for every ε > 0, nlogn ≤ f (n) ≤ nεn holds if n is sufficiently large. Suppose that log f (n)/ logn is nondecreasing. Using sequences of finite alternating groups, forExpand
On amenability of automata groups
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based onExpand
An Uncountable family of 3-Generated Groups with Isomorphic Profinite Completions
TLDR
An uncountable family of 3-generated residually finite just-infinite groups with isomorphic profinite completions is constructed and it is shown that word growth rate is not a profinite property. Expand
RANDOM WALKS ON FREE PERIODIC GROUPS
An upper estimate is obtained for the growth exponent of the set of all uncancellable words equal to 1 in a group given by a system of defining relations with the Dehn condition. By a theorem ofExpand
On uniformly amenable groups
We consider the conditions of the uniform amenability of discrete groups. The equivalence of the uniform F0lner and Kesten conditions is proved. Also an example of the group which is amenable but notExpand
...
1
2
3
...