1992
DOI: 10.1112/blms/24.4.343
|View full text |Cite
|
Sign up to set email alerts
|

On Connected Transversals to Abelian Subgroups in Finite Groups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
20
0

Year Published

1993
1993
2019
2019

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 17 publications
(21 citation statements)
references
References 0 publications
1
20
0
Order By: Relevance
“…If a H = bH and b −1 a / ∈ Q then again G is generated by four elements from A ∪ B and |G| ≤ p 4 q 8 . Thus we may assume that b −1 a ∈ Q whenever a H = bH and we are in a situation which is similar to the one described in the proof of Theorem 3.1 of [5]. We proceed as in that proof and we conclude that A = B.…”
Section: Next Assume That [A B] ≤ Q(a) Where Q(a) Is a Q-subgroup Ofmentioning
confidence: 81%
See 3 more Smart Citations
“…If a H = bH and b −1 a / ∈ Q then again G is generated by four elements from A ∪ B and |G| ≤ p 4 q 8 . Thus we may assume that b −1 a ∈ Q whenever a H = bH and we are in a situation which is similar to the one described in the proof of Theorem 3.1 of [5]. We proceed as in that proof and we conclude that A = B.…”
Section: Next Assume That [A B] ≤ Q(a) Where Q(a) Is a Q-subgroup Ofmentioning
confidence: 81%
“…If the elements h(a, b) ∈ Q for all a, b ∈ A then we can proceed as in the proof of Theorem 3.1 in [5] and we conclude that A is an abelian group. Thus G = AH and it follows from Lemma 2.5 that G is soluble.…”
Section: Next Assume That [A B] ≤ Q(a) Where Q(a) Is a Q-subgroup Ofmentioning
confidence: 92%
See 2 more Smart Citations
“…Much work in loop theory was devoted to attempting to prove this [9,16,24]. However, in 2004, Csörgő [7] constructed a loop Q of order 128, with abelian inner mapping group, and with c (Q) = 3.…”
Section: The Theoremmentioning
confidence: 99%