Results 31 to 40 of about 1,511,588 (309)
Groups with a Strongly Embedded Subgroup Saturated with Finite Simple Non-abelian Groups
An important concept in the theory of finite groups is the concept of a strongly embedded subgroup. The fundamental result on the structure of finite groups with a strongly embedded subgroup belongs to M. Suzuki.
A.A. Shlepkin
doaj +1 more source
All simple groups with order from 1 million to 5 million are efficient [PDF]
There is much interest in finding short presentations for the finite simple groups. Indeed it has been suggested that all these groups are efficient in a technical sense.
Edmund F. Robertson +3 more
doaj
On the Fundamental Group of a Simple Lie Group [PDF]
Let G be a simply connected simple Lie group and C the center of G, which is isomorphic with the fundamental group of the adjoint group of G. For an element c of C, an element x of the Lie algebra g of G is called a representative of c in g if exp x = c.
openaire +3 more sources
On base sizes for actions of finite classical groups [PDF]
Let G be a finite almost simple classical group and let ? be a faithful primitive non-standard G-set. A base for G is a subset B C_ ? whose pointwise stabilizer is trivial; we write b(G) for the minimal size of a base for G.
Timothy C. Burness +2 more
core +1 more source
Centralizers in simple locally finite groups [PDF]
This is a survey article on centralizers of finitesubgroups in locally finite, simple groups or LFS-groups as wewill call them. We mention some of the open problems aboutcentralizers of subgroups in LFS-groups and applications of theknown information ...
Mahmut Kuzucuoğlu
doaj
Totally -closed finite groups with trivial Fitting subgroup
A finite permutation group [Formula: see text] is called [Formula: see text]-closed if [Formula: see text] is the largest subgroup of [Formula: see text] which leaves invariant each of the [Formula: see text]-orbits for the induced action on [Formula ...
Majid Arezoomand +3 more
doaj +1 more source
GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, we prove sharp upper bounds on $d(H)$ whenever $H$ is a maximal subgroup of a finite almost simple group.
ANDREA LUCCHINI +2 more
doaj +1 more source
Symmetric Presentations of Coxeter Groups [PDF]
We apply the techniques of symmetric generation to establish the standard presentations of the finite simply laced irreducible finite Coxeter groups, that is, the Coxeter groups of types An, Dn and En, and show that these are naturally arrived at purely ...
Fairbairn, Ben, Ben Fairbairn
core +1 more source
Homogenous finitary symmetric groups [PDF]
We characterize strictly diagonal type of embeddings of finitary symmetric groups in terms of cardinality and the characteristic. Namely, we prove the following. Let kappa be an infinite cardinal. If G=underseti=1stackrelinftybigcupG i , where G i =
Otto. H. Kegel +1 more
doaj
Recognition of the Simple Groups 2D8((2n)2)
One of the important problems in finite groups theory is group characterization by specific property. Properties, such as element orders, set of elements with the same order, the largest element order, etc.
Ebrahimzadeh Behnam
doaj +1 more source

