Results 61 to 70 of about 5,389,809 (116)
Minimal non-nilpotent groups which are supersolvable
, 2009 The structure of a group which is not nilpotent but all of whose proper subgroups are nilpotent has interested the researches of several authors both in the finite case and in the infinite case. The present paper generalizes some classic descriptions of M. Newman, H. Smith and J. Wiegold in the context of supersolvable groups.
openaire +3 more sources
A contribution to the theory of finite supersolvable groups
Journal of Algebra, 1979 The relationship between nilpotence of finite groups and the normality of (i) all maximal subgroups or (ii) all Sylow subgroups, is well known. Using Sylow systems of a subgroup, the author defines concepts of weak normaliser and weak centraliser and uses these to describe properties of supersolvable groups. For example, previous results of the author [
openaire +2 more sources
THE LOCAL STRUCTURE OF THE ARTIN ROOT NUMBER. [PDF]
Proc Natl Acad Sci U S A, 1955 Dwork B.
europepmc +1 more source
Supersolvable saturated matroids and chordal graphs
, 2023 A matroid is supersolvable if it has a maximal chain of flats each of which is modular. A matroid is saturated if every round flat is modular. In this article we present supersolvable saturated matroids as analogues to chordal graphs, and we show that ...
Probert, Andrew, Mayhew, Dillon
core
A Generalization of Semimodular Supersolvable Lattices
, 1999 Stanley [18] introduced the notion of a supersolvable lattice, L, in part to combinatorially explain the factorization of its characteristic polynomial over the integers when L is also semimodular.
Bruce E. Sagan, Curtis Bennett
core
Computing irreducible representations of supersolvable groups over small finite fields
We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK |G|, which is not assumed to be a splitting field of G.
Omrani, A., Shokrollahi, A
core +1 more source
Supersolvable automorphism groups of solvable groups
Mathematische Zeitschrift, 1983 openaire +1 more source
How Is a Chordal Graph Like a Supersolvable Binary Matroid?
, 2007 Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable i# G is chordal (rigid): this is an other way to read Dirac's theorem on chordal graphs.
Sulamita Klein +2 more
core
Finite Minimal Non-$ \sigma $-Supersolvable Groups
Siberian Mathematical JournalAbstract Let $ \sigma $ be a partition of the set of all primes. A finite group $ G $ is said to be ...
openaire +1 more source
Residual properties of nilpotent and supersolvable groups
Journal of Algebra, 1972 Allenby, R.B.J.T, Gregorac, R.J
openaire +1 more source