Results 31 to 40 of about 229,870 (85)

Counting supersolvable and solvable group orders

open access: yesResearch in Mathematics
Edward Bertram, Guanhong Li
openaire   +1 more source

Rings having solvable adjoint groups

open access: yes, 1970
P. Bhattacharya, S. Jain
semanticscholar   +1 more source
Some of the next articles are maybe not open access.

Related searches:

GBRDs over supersolvable groups and solvable groups of order prime to 3

Designs, Codes and Cryptography, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abel, R. Julian R.   +3 more
semanticscholar   +4 more sources

Some characterizations of $\pi$-solvable and supersolvable groups using $\theta$-pairs

open access: yesPublicationes Mathematicae Debrecen, 2002
Summary: For a finite group \(G\), \(D_p(G)\) is a generalization of the Frattini subgroup of \(G\). We obtain some results on \(\pi\)-solvable and supersolvable groups with the help of \(D_p(G)\) using \(\theta\)-pairs.
Dutta, T. K., Sen, P.
openaire   +2 more sources

Finite groups whose maximal subgroups of order divisible by all the primes are supersolvable

Monatshefte für Mathematik (Print), 2021
We study finite groups G with the property that for any subgroup M maximal in G whose order is divisible by all the prime divisors of | G |, M is supersolvable.
A. Moretó
semanticscholar   +2 more sources

On the embedding of finite solvable groups

Communications in Algebra, 2022
In 1969, Seitz proved that every finite solvable group can be (isomorphically) embedded in a monomial group with the same derived length (fitting length, supersolvable length).
Gurleen Kaur
semanticscholar   +1 more source

Criteria for the p-solvability and p-supersolvability of finite groups

Mathematical Notes, 2013
A subgroup \(A\) of a finite group \(G\) \textit{covers} the maximal pair \((K,H)\), where \(K\) and \(H\) are subgroups of \(G\) such that \(K\) is a maximal subgroup of \(H\), if \(AH=AK\) and \textit{avoids} \((K,H)\) if \(A\cap K=A\cap H\). Every permutable subgroup covers or avoids every maximal pair, but the converse is not true in general.
Liu, Yufeng   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy