1990
DOI: 10.1007/bf01062091
|View full text |Cite
|
Sign up to set email alerts
|

Theorem on groups of finite special rank

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

1996
1996
2021
2021

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(26 citation statements)
references
References 5 publications
0
26
0
Order By: Relevance
“…(c) A locally finite group of finite rank is almost locally soluble, that is, it has a normal locally soluble subgroup of finite index [14]. Indeed, the same holds for locally (soluble-by-finite) groups, by [3] (see also [4]).…”
Section: Is Countable Then H and K May Be Chosen So That I G (H) = G mentioning
confidence: 98%
See 1 more Smart Citation
“…(c) A locally finite group of finite rank is almost locally soluble, that is, it has a normal locally soluble subgroup of finite index [14]. Indeed, the same holds for locally (soluble-by-finite) groups, by [3] (see also [4]).…”
Section: Is Countable Then H and K May Be Chosen So That I G (H) = G mentioning
confidence: 98%
“…Clearly there is an integer r such that every finitely generated subgroup of G is r-generated, that is, G has rank at most r. By [3] G is almost locally soluble and hence almost soluble, since there is a finite upper bound for the derived length of soluble subgroups. Since our hypothesis is inherited by homomorphic images we may assume by induction that G is abelian-by-finite.…”
Section: Lemma 4 Let X Be a Finitely Generated Nilpotent-by-finite Gmentioning
confidence: 99%
“…In [1],Černikov introduced an extensive class of groups and proved that -groups of finite rank are almost locally soluble. Since all locally soluble-by-finite groups belong to ,Černikov's result and Lemma 7 together show that G is almost locally soluble and of finite rank.…”
Section: Lemma 8 Let G Be a Locally Soluble-by-finite Minimax Groupmentioning
confidence: 99%
“…Since the hypotheses are inherited by subgroups, we may choose a finitely generated counterexample G. It follows from a result of N. S.Černikov [2] that G has infinite rank. Let L be a chain of normal subgroups of G such that for every L ∈ L the factor group G/L is not soluble-by-finite, and put K =…”
Section: Subgroups With the Neumann Propertymentioning
confidence: 99%