2015
DOI: 10.1007/s00013-015-0797-7
|View full text |Cite
|
Sign up to set email alerts
|

Finite generation of iterated wreath products in product action

Abstract: Let S be a sequence of finite perfect transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated wreath product in product action of the groups in S is topologically finitely generated, provided that the actions of the groups in S are not regular. We prove that our bound has the right asymptotic behaviour. We also deduce that other infinitely iterated mixed wreath products of groups in S are finitely generated. Finally we apply our methods to find explicitl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…By [Re,Theorem 6.2] and [Va15], every infinitely iterated wreath product w.r.t. product actions W pa (S), based on a sequence S of finite non-abelian simple permutation groups, is a finitely generated hereditarily just infinite profinite group that is not virtually pro-p for any prime p. In [Wi,Va15,Va16,KV] some embedding, generation and presentation properties of such groups have been established, but many of their features are not yet fully understood.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…By [Re,Theorem 6.2] and [Va15], every infinitely iterated wreath product w.r.t. product actions W pa (S), based on a sequence S of finite non-abelian simple permutation groups, is a finitely generated hereditarily just infinite profinite group that is not virtually pro-p for any prime p. In [Wi,Va15,Va16,KV] some embedding, generation and presentation properties of such groups have been established, but many of their features are not yet fully understood.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…Its basic properties as a permutation group were obtained in [8]. Exponentiation was applied to construct and study new strongly regular graphs ( [15,16]), to study automorphism group of the n-dimensional cube ( [5,6]), to construct new őnite Gelfand pairs ( [2]) and to construct new őnitely generated proőnite groups ( [17]). We observe that exponentiation can be applied to construct groups deőned by őnite automata.…”
Section: Introductionmentioning
confidence: 99%
“…The question of finite generation of various infinite iterated wreath products was considered by several authors. See [Bha94], [Qui06], [Qui04], [Bon10], [Van15]. All these works consider wreath products of transitive group actions.…”
mentioning
confidence: 99%