2015
DOI: 10.1016/j.jpaa.2014.05.030
|View full text |Cite
|
Sign up to set email alerts
|

On countable coverings of word values in profinite groups

Abstract: Abstract. We prove the following results. Let w be a multilinear commutator word. If G is a profinite group in which all w-values are contained in a union of countably many periodic subgroups, then the verbal subgroup w(G) is locally finite. If G is a profinite group in which all w-values are contained in a union of countably many subgroups of finite rank, then the verbal subgroup w(G) has finite rank as well. As a byproduct of the techniques developed in the paper we also prove that if G is a virtually solubl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
23
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
6

Relationship

6
0

Authors

Journals

citations
Cited by 14 publications
(24 citation statements)
references
References 14 publications
1
23
0
Order By: Relevance
“…Proposition 2.1 enables us to strengthen this result: we show -without recourse to the Continuum Hypothesis (or Martin's Axiom) -that every multilinear commutator word is strongly concise. For this we employ combinatorial techniques that were developed in [2,4,5] specifically for handling multilinear commutator words.…”
Section: Multilinear Commutator Wordsmentioning
confidence: 99%
See 1 more Smart Citation
“…Proposition 2.1 enables us to strengthen this result: we show -without recourse to the Continuum Hypothesis (or Martin's Axiom) -that every multilinear commutator word is strongly concise. For this we employ combinatorial techniques that were developed in [2,4,5] specifically for handling multilinear commutator words.…”
Section: Multilinear Commutator Wordsmentioning
confidence: 99%
“…Then w[i] = w(G) (see [2,Proposition 7]) and, in particular, w(G) is abelian and periodic. Moreover, we have G w ⊆ G w , so the image of the continuous map 4.…”
Section: Multilinear Commutator Wordsmentioning
confidence: 99%
“…There is a conjecture stating that for any word w and any profinite group G in which all w-values have finite order, the verbal subgroup w(G) is locally finite. The conjecture is known to be correct in a number of particular cases (see [28,17,3]). In Section 5 we obtain another result in this direction.…”
Section: Introductionmentioning
confidence: 97%
“…The next section contains a collection of mostly well-known auxiliary lemmas which are used throughout the paper. In Section 3 we describe combinatorial techniques developed in [8,3,4] for handling multilinear commutator words. We also prove some new lemmas which are necessary for the purposes of the present article.…”
Section: Introductionmentioning
confidence: 99%
“…The reader can consult the articles [2,3,4,6,7,12] for results on countable coverings of word-values by subgroups. One of the results obtained in [7] is that if w is a multilinear commutator and G is a profinite group, then w(G) is finite-by-nilpotent if and only if the set of w-values in G is covered by countably many finite-by-nilpotent subgroups (see Section 2 for the definition of multilinear commutator).…”
Section: Introductionmentioning
confidence: 99%