scholarly journals Solvable Groups Having Almost Relatively Prime Distinct Irreducible Character Degrees

1995 ◽  
Vol 174 (1) ◽  
pp. 197-216 ◽  
Author(s):  
M.L. Lewis
2006 ◽  
Vol 49 (2) ◽  
pp. 285-295 ◽  
Author(s):  
Jeffrey M. Riedl

AbstractWe extend a result of Noritzsch, which describes the orbit sizes in the action of a Frobenius group G on a finite vector space V under certain conditions, to a more general class of finite solvable groups G. This result has applications in computing irreducible character degrees of finite groups. Another application, proved here, is a result concerning the structure of certain groups with few complex irreducible character degrees.


2021 ◽  
pp. 1-12
Author(s):  
Kamal Aziziheris ◽  
Farideh Shafiei ◽  
Farrokh Shirjian

1988 ◽  
Vol 30 (2) ◽  
pp. 221-230 ◽  
Author(s):  
Michael C. Slattery

There are a number of theorems which bound d.l.(G), the derived length of a group G, in terms of the size of the set c.d.(G) of irreducible character degrees of G assuming that G is in some particular class of solvable groups ([1], [3], [4], [7]). For instance, Gluck [4] shows that d.l.(G)≤2 |c.d.(G)| for any solvable group, whereas Berger [1] shows that d.l.(G)≤|c.d.(G)| if G has odd order. One of the oldest (and smallest) such bounds is a theorem of Taketa [7] which says that d.l.(G)≤|c.d.(G)| if G is an M-group. Most of the existing theorems are an attempt to extend Taketa's bound to all solvable groups. However, it is not even known for M-groups whether or not this is the best possible bound. This suggests that given a class of solvable groups one might try to find the maximum derived length of a group with n character degrees (i.e. the best possible bound).


2006 ◽  
Vol 49 (1) ◽  
pp. 127-133 ◽  
Author(s):  
Mark L. Lewis

AbstractGiven a finite group G, we attach to the character degrees of G a graph whose vertex set is the set of primes dividing the degrees of irreducible characters of G, and with an edge between p and q if pq divides the degree of some irreducible character of G. In this paper, we describe which graphs occur when G is a solvable group of Fitting height 2.


1989 ◽  
Vol 105 (2) ◽  
pp. 237-240 ◽  
Author(s):  
R. Gow

Let G be a finite group and let Irr(G) denote the set of complex irreducible characters of G. Various authors have investigated the question of how information about the degrees of the characters in Irr (G) can provide information about the structure of G. Chapter 12 of [2] gives a survey of a number of results arising from such questions. Two well-known examples of theorems that relate character degrees and group structure are those due to Thompson (12·2 in [2]) and Itô (12.34 in [2]), which we recall here.


2020 ◽  
Vol 18 (1) ◽  
pp. 907-915
Author(s):  
Zhongbi Wang ◽  
Chao Qin ◽  
Heng Lv ◽  
Yanxiong Yan ◽  
Guiyun Chen

Abstract For a positive integer n and a prime p, let {n}_{p} denote the p-part of n. Let G be a group, \text{cd}(G) the set of all irreducible character degrees of G , \rho (G) the set of all prime divisors of integers in \text{cd}(G) , V(G)=\left\{{p}^{{e}_{p}(G)}|p\in \rho (G)\right\} , where {p}^{{e}_{p}(G)}=\hspace{.25em}\max \hspace{.25em}\{\chi {(1)}_{p}|\chi \in \text{Irr}(G)\}. In this article, it is proved that G\cong {L}_{2}({p}^{2}) if and only if |G|=|{L}_{2}({p}^{2})| and V(G)=V({L}_{2}({p}^{2})) .


2019 ◽  
Vol 19 (02) ◽  
pp. 2050036
Author(s):  
Morteza Baniasad Azad ◽  
Behrooz Khosravi

In this paper, we prove that the direct product [Formula: see text], where [Formula: see text] are distinct numbers, is uniquely determined by its complex group algebra. Particularly, we show that the direct product [Formula: see text], where [Formula: see text]’s are distinct odd prime numbers, is uniquely determined by its order and three irreducible character degrees.


2020 ◽  
Vol 23 (6) ◽  
pp. 1111-1122
Author(s):  
Sarah Croome ◽  
Mark L. Lewis

AbstractLet G be a p-group, and let χ be an irreducible character of G. The codegree of χ is given by {\lvert G:\operatorname{ker}(\chi)\rvert/\chi(1)}. Du and Lewis have shown that a p-group with exactly three codegrees has nilpotence class at most 2. Here we investigate p-groups with exactly four codegrees. If, in addition to having exactly four codegrees, G has two irreducible character degrees, G has largest irreducible character degree {p^{2}}, {\lvert G:G^{\prime}\rvert=p^{2}}, or G has coclass at most 3, then G has nilpotence class at most 4. In the case of coclass at most 3, the order of G is bounded by {p^{7}}. With an additional hypothesis, we can extend this result to p-groups with four codegrees and coclass at most 6. In this case, the order of G is bounded by {p^{10}}.


Sign in / Sign up

Export Citation Format

Share Document