Results 51 to 60 of about 5,389,809 (116)
On the solvable, nilpotent, and supersolvable groups of order at most two hundred [PDF]
The emphasis of this paper is to determine whether a group is solvable (resp., nilpotent, supersolvable) based on its order. Throughout the thesis, a number is considered solvable (resp., nilpotent, supersolvable) if every group of that particular order ...
Smith, Derek Keith
core
Finite groups with supersolvable subgroup cofactors
Let in group О maximal subgroup cofactors be supersolvable. It is proved that non-Abelian composition factors are iso morphic to group PSL(2, p\ p - primes, p = ± 1 (mod 8). If group G is soluble then its nilpotent length does not exceed 3, p-length /ДО)
Евтухова, С. М. +1 more
core +2 more sources
The pro-supersolvable topology on a free group: deciding denseness [PDF]
Let $F$ be a free group of arbitrary rank and let $H$ be a finitely generated subgroup of $F$. Given a pseudovariety $\mathbf{V}$ of finite groups, i.e.
Tracey, Gareth +2 more
core +1 more source
Large Orbits of Supersolvable Linear Groups
The study of regular orbits of linear groups plays an important role in representation theory, particularly that of solvable groups because a chief factor of a solvable group \(G\) is an irreducible \(G\)-module. Existence of regular orbits has had applications to Brauer's conjectures on height zero characters and block size as well as length-type ...
openaire +1 more source
A generalization of Hall-complementation in finite supersolvable groups [PDF]
g*: For each normal subgroup N$ 'P(G), each reduced product of G over N is a semidirect product. (G = NB is a reduced product over a normal subgroup N by a subgroup B iff B does not contain a proper subgroup B* such that G = NB*.) F. Gross [5] has shown that for a finite solvable group G having 4!(G) = 1, splitting over each normal subgroup is ...
openaire +2 more sources
Supersolvable descent for rational points
International audienceWe construct an analogue of the classical descent theory of Colliot-Thélène and Sansuc in which algebraic tori are replaced with finite supersolvable groups.
Harpaz, Yonatan, Wittenberg, Olivier
core +1 more source
How Is a Chordal Graph Like a Supersolvable Binary Matroid? [PDF]
Let G be a finite simple graph Fromth pioneering work of R.P. Stanley it is known that the cycle matroid of G is supersolvable iff G ischfi'J' (rigid):thg is another way to read Dirac'sthLTPO onchO'PO graphO ChphO binary matroids are
Forge, David +5 more
core +1 more source
p-supersolvability of factorized finite groups
The author calls two subgroups \(H\), \(K\) of a group mutually permutable if \(H\) is permutable with every subgroup of \(K\) and \(K\) is permutable with every subgroup of \(H\). He obtains the following main results: If \(G = HK \neq 1\) and \(H\) and \(K\) are mutually permutable, then \(H\) or \(K\) contains a nontrivial normal subgroup of \(G ...
openaire +3 more sources
M-groups and the supersolvable residual
A finite group G is an M-group (monomial group) if each irreducible complex character of G is induced from a linear character of a subgroup of G. It is well known that M-groups are always solvable and that certain types of solvable groups are M-groups. In [5] Dornhoff proved a theorem implying that the class of M-groups is rather large.
openaire +1 more source
On supersolvable and nearly supersolvable line arrangements
v.2, major changes, main new result is Proposition 2.1International audienceWe introduce a new class of line arrangements in the projective plane, called nearly supersolvable, and show that any arrangement in this class is either free or nearly free ...
Dimca, Alexandru, Sticlaru, Gabriel
core +1 more source

