نتایج جستجو برای: character degrees

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

In this paper we describe how the degrees of the irreducible characters of the affine subgroups of the classical groups under consideration can be found inductively. In [4] Gow obtained certain character degrees for all of the affine subgroups of the classical groups. We apply the method of Fischer to the above groups and, in addition to the character degrees given in [4], we obtain some ne...

Journal: :journal of sciences islamic republic of iran 0

in this paper we describe how the degrees of the irreducible characters of the affine subgroups of the classical groups under consideration can be found inductively. in [4] gow obtained certain character degrees for all of the affine subgroups of the classical groups. we apply the method of fischer to the above groups and, in addition to the character degrees given in [4], we obtain some new ch...

Journal: :international journal of group theory 2015
mark l. lewis john k. mcvey

in a previous paper, the second author established that, given finite fields $f < e$ and certain subgroups $c leq e^times$, there is a galois connection between the intermediate field lattice ${l mid f leq l leq e}$ and $c$'s subgroup lattice. based on the galois connection, the paper then calculated the irreducible, complex character degrees of the semi-direct product $c rtimes {rm gal} (e/f)$...

Journal: :international journal of group theory 0
seyed ali moosavi university of qom

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

Journal: :international journal of group theory 2015
seyed ali moosavi

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 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$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...

Journal: :international journal of group theory 2012
hung p tong-viet thomas p wakefield

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)}.$‎

Journal: :Proceedings of the American Mathematical Society 1987

Journal: :Proceedings of the American Mathematical Society 1998

Journal: :Proceedings of the American Mathematical Society 1978

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

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