Infinite groups with Sylow permutable subgroups

2009 ◽  
Vol 189 (4) ◽  
pp. 553-565 ◽  
Author(s):  
Adolfo Ballester-Bolinches ◽  
Leonid A. Kurdachenko ◽  
Javier Otal ◽  
Tatiana Pedraza
2014 ◽  
Vol 398 ◽  
pp. 156-161
Author(s):  
A. Ballester-Bolinches ◽  
S. Camp-Mora ◽  
L.A. Kurdachenko

2008 ◽  
pp. 745-764 ◽  
Author(s):  
A. Ballester-Bolinches ◽  
L. Kurdachenko ◽  
J. Otal ◽  
T. Pedraza

2014 ◽  
Vol 56 (3) ◽  
pp. 691-703 ◽  
Author(s):  
A. BALLESTER-BOLINCHES ◽  
J. C. BEIDLEMAN ◽  
A. D. FELDMAN ◽  
M. F. RAGLAND

AbstractFor a formation $\mathfrak F$, a subgroup M of a finite group G is said to be $\mathfrak F$-pronormal in G if for each g ∈ G, there exists x ∈ 〈U,Ug〉$\mathfrak F$ such that Ux = Ug. Let f be a subgroup embedding functor such that f(G) contains the set of normal subgroups of G and is contained in the set of Sylow-permutable subgroups of G for every finite group G. Given such an f, let fT denote the class of finite groups in which f(G) is the set of subnormal subgroups of G; this is the class of all finite groups G in which to be in f(G) is a transitive relation in G. A subgroup M of a finite group G is said to be $\mathfrak F$-normal in G if G/CoreG(M) belongs to $\mathfrak F$. A subgroup U of a finite group G is called K-$\mathfrak F$-subnormal in G if either U = G or there exist subgroups U = U0 ≤ U1 ≤ . . . ≤ Un = G such that Ui–1 is either normal or $\mathfrak F$-normal in Ui, for i = 1,2, …, n. We call a finite group G an $fT_{\mathfrak F}$-group if every K-$\mathfrak F$-subnormal subgroup of G is in f(G). In this paper, we analyse for certain formations $\mathfrak F$ the structure of $fT_{\mathfrak F}$-groups. We pay special attention to the $\mathfrak F$-pronormal subgroups in this analysis.


2017 ◽  
Vol 29 (6) ◽  
Author(s):  
Adolfo Ballester-Bolinches ◽  
Hermann Heineken ◽  
Francesca Spagnuolo

AbstractA subgroup


2013 ◽  
Vol 11 (11) ◽  
Author(s):  
Adolfo Ballester-Bolinches ◽  
Enric Cosme-Llópez ◽  
Ramón Esteban-Romero

AbstractIn this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.


1972 ◽  
Vol 125 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Stewart E. Stonehewer

1969 ◽  
Vol 10 (1-2) ◽  
pp. 162-168 ◽  
Author(s):  
Vlastimil Dlab ◽  
B. H. Neumann

Large finite groups have large automorphism groups [4]; infinite groups may, like the infinite cyclic group, have finite automorphism groups, but their endomorphism semigroups are infinite (see Baer [1, p. 530] or [2, p. 68]). We show in this paper that the corresponding propositions for semigroups are false.


1990 ◽  
Vol 30 (3) ◽  
pp. 155-170
Author(s):  
Jörg Brendle

1982 ◽  
Vol 33 (3) ◽  
pp. 313-316
Author(s):  
L. A. Kurdachenko ◽  
N. F. Kuzennyi ◽  
V. V. Pylaev

Sign in / Sign up

Export Citation Format

Share Document