There has been some interest on how the average character degree affects structure of a finite group. We define, and denote by $ \mathrm{anz}(G) $, number zeros characters group G as in table divided irreducible $. show that if < 1 then is solvable also \frac{1}{2} supersolvable. characterise abelian groups showing \frac{1}{3} only abelian.

–Let p be a prime number, G p-solvable finite group and P Sylow p-subgroup of G. We prove that is p-supersolvable if NG(P) there subgroup H with P??H??(P) such s-semipermutable in As applications, we simplify the proofs some known results also generalize 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...

Comparing two expressions of the Tutte polynomial of an ordered oriented matroid yields a remarkable numerical relation between the numbers of reorientations and bases with given activities. A natural activity preserving reorientation-to-basis mapping compatible with this relation is described in a series of papers by the present authors. This mapping, equivalent to a bijection between regions ...

A subalgebra $B$ of a Lie algebra $L$ is called weak c-ideal if there subideal $C$ such that $L=B+C$ and $B\cap C\leq B_{L} $ where $B_{L}$ the largest ideal contained in $B.$ This analogous to concept weakly c-normal subgroups, which has been studied by number authors. We obtain some properties c-ideals use them give characterisations solvable supersolvable algebras. also note one-dimensional ...

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...