نتایج جستجو برای: finite group

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

Journal: :bulletin of the iranian mathematical society 2013
a. azad s. fouladi r. orfi

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

Journal: :international journal of group theory 0
seyyed majid jafarian amiri department of mathematics, faculty of sciences, university of zanjan

let $g$ be a finite group‎. ‎we denote by $psi(g)$ the integer $sum_{gin g}o(g)$‎, ‎where $o(g)$ denotes the order of $g in g$‎. ‎here we show that‎ ‎$psi(a_5)< psi(g)$ for every non-simple group $g$ of order $60$‎, ‎where $a_5$ is the alternating group of degree $5$‎. ‎also we prove that $psi(psl(2,7))

Journal: :algebraic structures and their applications 2014
sh. payrovi h. pasebani

let $g$ be a group. the order graph of $g$ is the (undirected)graph $gamma(g)$,those whose vertices are non-trivial subgroups of $g$ and two distinctvertices $h$ and $k$ are adjacent if and only if either$o(h)|o(k)$ or $o(k)|o(h)$. in this paper, we investigate theinterplay between the group-theoretic properties of $g$ and thegraph-theoretic properties of $gamma(g)$. for a finite group$g$, we s...

Journal: :journal of linear and topological algebra (jlta) 0
a gholamian farhangian university, shahid bahonar campus, birjand, iran m. m nasrabadi university of birjand, birjand, iran

let $g$ be a group and $aut(g)$ be the group of automorphisms of‎‎$g$‎. ‎for any natural‎‎number $m$‎, ‎the $m^{th}$-autocommutator subgroup of $g$ is defined‎‎as‎: ‎$$k_{m}(g)=langle[g,alpha_{1},ldots,alpha_{m}] |gin g‎,‎alpha_{1},ldots,alpha_{m}in aut(g)rangle.$$‎‎in this paper‎, ‎we obtain the $m^{th}$-autocommutator subgroup of‎‎all finite abelian groups‎.

Journal: :international journal of group theory 2014
sunil kumar prajapati balasubramanian sury

for a finite group $g$‎, ‎we study the total character $tau_g$‎ ‎afforded by the direct sum of all the non-isomorphic irreducible‎ ‎complex representations of $g$‎. ‎we resolve for several classes of‎ ‎groups (the camina $p$-groups‎, ‎the generalized camina $p$-groups‎, ‎the groups which admit $(g,z(g))$ as a generalized camina pair)‎, ‎the problem of existence of a‎ ‎polynomial $f(x) in mathbb...

Journal: :bulletin of the iranian mathematical society 2015
s. k. prajapati r. sarma

suppose $f$ is a map from a non-empty finite set $x$ to a finite group $g$. define the map $zeta^f_g: glongrightarrow mathbb{n}cup {0}$ by $gmapsto |f^{-1}(g)|$. in this article, we show that for a suitable choice of $f$, the map $zeta^f_g$ is a character. we use our results to show that the solution function for the word equation $w(t_1,t_2,dots,t_n)=g$ ($gin g$) is a character, where $w(t_1,t...

Journal: :Journal of Pure and Applied Algebra 1978

Journal: :international journal of group theory 2012
mohammad reza darafsheh pedram yousefzadeh

the non-commuting graph $nabla(g)$ of a non-abelian group $g$ is defined as follows: its vertex set is $g-z(g)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. in this paper we 'll prove that if $g$ is a finite group with $nabla(g)congnabla(bs_{n})$, then $g cong bs_{n}$, where $bs_{n}$ is the symmetric group of degre...

G. H. FATH TABAR,

Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.

Journal: :bulletin of the iranian mathematical society 0
q. mushtaq vice chancellor, the islamia university of bahawalpur, pakistan. a. razaq department of mathematics, govt. post graduate college jauharabad, pakistan.

graham higman has defined coset diagrams for psl(2,ℤ). these diagrams are composed of fragments, and the fragments are further composed of two or more circuits. q. mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

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

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