نتایج جستجو برای: finite simple group
تعداد نتایج: 1621766 فیلتر نتایج به سال:
let $g $ be a finite group and let $gamma(g)$ be the prime graph of g. assume $2 < q = p^{alpha} < 100$. we determine finite groups g such that $gamma(g) = gamma(u_3(q))$ and prove that if $q neq 3, 5, 9, 17$, then $u_3(q)$ is quasirecognizable by prime graph, i.e. if $g$ is a finite group with the same prime graph as the finite simple group $u_3(q)$, then $g$ has a un...
The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...
the purpose of the present study was to see which one of the two instruction-processing instruction (pi) and meaningful output based instruction (mobi) accompanied with prompt and recast- is more effective on efl learners’ writing accuracy. in order to homogenize the participants in term of language proficiency a preliminary english test (pet) was administrated between 74 intermediate students ...
let $g$ be a finite group and let $text{cd}(g)$ be the set of all complex irreducible character degrees of $g$. b. huppert conjectured that if $h$ is a finite nonabelian simple group such that $text{cd}(g) =text{cd}(h)$, then $gcong h times a$, where $a$ is an abelian group. in this paper, we verify the conjecture for ${f_4(2)}.$
let $g$ be a finite group and let $text{cd}(g)$ be the set of all complex irreducible character degrees of $g$. b. huppert conjectured that if $h$ is a finite nonabelian simple group such that $text{cd}(g) =text{cd}(h)$, then $gcong h times a$, where $a$ is an abelian group. in this paper, we verify the conjecture for ${f_4(2)}.$
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید