A subgroup H of a finite group G is said to be W -S-permutable in G if there is a subgroup K of G such that G = HK and H ∩K is a nearly S-permutable subgroup of G. In this article, we analyse the structure of a finite group G by using the properties of W -S-permutable subgroups and obtain some new characterizations of finite p-nilpotent groups and finite supersolvable groups. Some known results...

The aim of this note is a classification of all nice and all inductively factored reflection arrangements. It turns out that apart from the supersolvable instances only the monomial groups G(r, r, 3) for r > 3 give rise to nice reflection arrangements. As a consequence of this and of the classification of all inductively free reflection arrangements from Hoge and Röhrle (2015) we deduce that th...

We study finite groups G with the property that for any subgroup M maximal in whose order is divisible by all prime divisors of |G|, supersolvable. show nonabelian simple group can occur as a composition factor such and that, if solvable, then nilpotency length rank are arbitrarily large. On other hand, every p, p-length at most 1. This answers questions proposed V. Monakhov The Kourovka Notebo...

Abstract In this paper, we call a finite group G G an N L M NLM -group ( C NCM -group, respectively) if every non-normal cyclic subgroup of prime order or 4 (prime power order, in is contained maximal . Using the property -groups and -groups, give new necessary suffic...

We show that certain twisting deformations of a family of supersolvable groups are simple as Hopf algebras. These groups are direct products of two generalized dihedral groups. Examples of this construction arise in dimensions 60 and pq, for prime numbers p, q with q|p − 1. We also show that certain twisting deformation of the symmetric group is simple as a Hopf algebra. On the other hand, we p...

It is well known that if a finite graded lattice of rank n is supersolvable, then it has an EL-labeling where the labels along any maximal chain form a permutation. We call such a labeling an Sn EL-labeling and we show that a finite graded lattice of rank n is supersolvable if and only if it has such a labeling. We next consider finite graded posets of rank n with 0̂ and 1̂ that have an Sn EL-lab...

Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.