نتایج جستجو برای: supersolvable number

تعداد نتایج: 1168458  

2008
SIMONA SETTEPANELLA

Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and reach thereby a weakening of the conditions required to actually determine such orderings. A class of arrangements for which the construction of the minimal comp...

2008
Jay Schweig

In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Möbius functions and rank-selected subposets of such lattices, rank-selected geometric lattices, and rank-selected face posets of shellable complexes which do not include the top rank. These decompositions give us many new inequalities for the h-vecto...

Journal: :Comptes Rendus Mathematique 2021

The class of Worpitzky-compatible subarrangements a Weyl arrangement together with an associated Eulerian polynomial was recently introduced by Ashraf, Yoshinaga and the first author, which brings characteristic Ehrhart quasi-polynomials into one formula. braid arrangement, type A, are known as graphic arrangements. We prove that arrangements characterized cocomparability graphs. This can be re...

Journal: :Journal of Combinatorial Theory, Series A 2016

2005
Shiheng Li Wujie Shi

Let M be a maximal subgroup of a finite group G and K/L be a chief factor such that L ≤ M while K * M . We call the group M ∩ K/L a c-section of M . And we define Sec(M) to be the abstract group that is isomorphic to a c-section of M . For every maximal subgroup M of G, assume that Sec(M) is supersolvable. Then any composition factor of G is isomorphic to L2(p) or Zq, where p and q are primes, ...

Journal: :J. Comb. Theory, Ser. A 2014
Ruth Davidson Patricia Hersh

Geometric lattices are characterized as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are shown to be exactly those finite lattices such that every ordering on the join-irreducibles induces a lexicographic shelling. This new characterization fits into a similar ...

2016
Jinxin Gao Xiuyun Guo

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

Journal: :Monatshefte für Mathematik 2021

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

Journal: :international journal of group theory 0
jiangtao shi yantai university

let $g={rm sl}_2(p^f)$ be a special linear group and $p$ be a sylow‎ ‎$2$-subgroup of $g$‎, ‎where $p$ is a prime and $f$ is a positive‎ ‎integer such that $p^f>3$‎. ‎by $n_g(p)$ we denote the normalizer of‎ ‎$p$ in $g$‎. ‎in this paper‎, ‎we show that $n_g(p)$ is nilpotent (or‎ ‎$2$-nilpotent‎, ‎or supersolvable) if and only if $p^{2f}equiv‎ ‎1,({rm mod},16)$‎.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید