نتایج جستجو برای: solvable
تعداد نتایج: 11273 فیلتر نتایج به سال:
in this paper, we give a complete proof of theorem 4.1(ii) and a new elementary proof of theorem 4.1(i) in [li and shen, on the intersection of the normalizers of the derived subgroups of all subgroups of a finite group, j. algebra, 323 (2010) 1349--1357]. in addition, we also give a generalization of baer's theorem.
In this paper, we study the notion of solvable $L$-subgroup of an $L$-group and provide its level subset characterization and this justifies the suitability of this extension. Throughout this work, we have used normality of an $L$-subgroup of an $L$-group in the sense of Wu rather than Liu.
the concept of the bipartite divisor graph for integer subsets has been considered in [m. a. iranmanesh and c. e. praeger, bipartite divisor graphs for integer subsets, {em graphs combin.}, {bf 26} (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g...
We give a survey of new characterizations of finite solvable groups and the solvable radical of an arbitrary finite group which were obtained over the past decade. We also discuss generalizations of these results to some classes of infinite groups and their analogues for Lie algebras. Some open problems are discussed as well.
In this paper we classify all finite solvable groups satisfying the following property P5: their orders of representatives are set-wise relatively prime for any 5 distinct non-central conjugacy classes.
Solvable structures, likewise solvable algebras of local symmetries, can be used to integrate scalar ODEs by quadratures. Solvable structures, however, are particularly suitable for the integration of ODEs with a lack of local symmetries. In fact, under regularity assumptions, any given ODE always admits solvable structures even though finding them in general could be a very difficult task. In ...
Let m be a positive integer and let ? finite set. The m-closure of G?Sym(?) is the largest permutation group on having same orbits as G in its induced action Cartesian product ?m. 1-closure 2-closure solvable need not solvable. We prove that always for m?3.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید