نتایج جستجو برای: simple k_4 groups
تعداد نتایج: 1159096 فیلتر نتایج به سال:
We answer in the negative a question of Hartley about representations finite groups, by constructing examples simple groups with arbitrarily large whose endomorphism ring consists just scalars. show as consequence that there are automorphisms locally group SL(∞,Fq) trivial centralizer. The smallest our is A6 q=9.
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
Suppose G is a group of order p^2q^2 where p>q are prime numbers and suppose P and Q are Sylow p-subgroups and Sylow q-subgroups of G, respectively. In this paper, we show that up to isomorphism, there are four groups of order p^2q^2 when Q and P are cyclic, three groups when Q is a cyclic and P is an elementary ablian group, p^2+3p/2+7 groups when Q is an elementary ablian group an...
Abstract We determine the maximum number of edges in a $$K_4$$ K 4 -minor-free n -vertex graph girth g , when $$g=5$$ g = 5 or is even. argue that there are many different extremal graphs if even ...
let $g$ be a finite group. in [ghasemabadi et al., characterizations of the simple group ${}^2d_n(3)$ by prime graph and spectrum, monatsh math., 2011] it is proved that if $n$ is odd, then ${}^2d _n(3)$ is recognizable by prime graph and also by element orders. in this paper we prove that if $n$ is even, then $d={}^2d_{n}(3)$ is quasirecognizable by prime graph, i.e...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید