scholarly journals 𝑝-groups with exactly four codegrees

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

2016 ◽  
Vol 15 (09) ◽  
pp. 1650164 ◽  
Author(s):  
Farideh Shafiei ◽  
Ali Iranmanesh

Let [Formula: see text] be a finite group and the irreducible character degree set of [Formula: see text] is contained in [Formula: see text], where [Formula: see text], and [Formula: see text] are distinct integers. We show that one of the following statements holds: [Formula: see text] is solvable; [Formula: see text]; or [Formula: see text] for some prime power [Formula: see text].


1985 ◽  
Vol 37 (3) ◽  
pp. 442-451 ◽  
Author(s):  
David Gluck

Much information about a finite group is encoded in its character table. Indeed even a small portion of the character table may reveal significant information about the group. By a famous theorem of Jordan, knowing the degree of one faithful irreducible character of a finite group gives an upper bound for the index of its largest normal abelian subgroup.Here we consider b(G), the largest irreducible character degree of the group G. A simple application of Frobenius reciprocity shows that b(G) ≧ |G:A| for any abelian subgroup A of G. In light of this fact and Jordan's theorem, one might seek to bound the index of the largest abelian subgroup of G from above by a function of b(G). If is G is nilpotent, a result of Isaacs and Passman (see [7, Theorem 12.26]) shows that G has an abelian subgroup of index at most b(G)4.


Author(s):  
Younes Rezayi ◽  
Ali Iranmanesh

‎Let G be a finite group and cd(G) be the set of irreducible character degree of G‎. ‎In this paper we prove that if  p is a prime number‎, ‎then the simple group PSL(4,p) is uniquely determined by its order and some its character degrees‎. 


2013 ◽  
Vol 13 (02) ◽  
pp. 1350096 ◽  
Author(s):  
MARK L. LEWIS ◽  
ALEXANDER MORETÓ

We conjecture that the number of irreducible character degrees of a finite group is bounded in terms of the number of prime factors (counting multiplicities) of the largest character degree. We prove that this conjecture holds when the largest character degree is prime and when the character degree graph is disconnected.


2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Shitian Liu

Isaacs, Passman, and Manz have determined the structure of finite groups whose each degree of the irreducible characters is a prime power. In particular, if G is a nonsolvable group and every character degree of a group G is a prime power, then G is isomorphic to S × A , where S ∈ A 5 , PSL 2 8 and A is abelian. In this paper, we change the condition, each character degree of a group G is a prime power, into the condition, each character degree of the proper subgroups of a group is a prime power, and give the structure of almost simple groups whose character degrees of all proper subgroups are all prime powers.


2010 ◽  
Vol 17 (spec01) ◽  
pp. 925-927 ◽  
Author(s):  
M. H. Jafari

Let b(G) denote the largest irreducible character degree of a finite group G. In this paper, we prove that if G is a solvable group which does not involve a section isomorphic to the wreath product of two groups of equal prime order p, and if b(G) < pn, then |G:Op(G)|p < pn.


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.


2019 ◽  
Vol 63 (2) ◽  
pp. 328-334
Author(s):  
Sarah Croome ◽  
Mark L. Lewis

AbstractLet $G$ be a $p$-group and let $\unicode[STIX]{x1D712}$ be an irreducible character of $G$. The codegree of $\unicode[STIX]{x1D712}$ is given by $|G:\,\text{ker}(\unicode[STIX]{x1D712})|/\unicode[STIX]{x1D712}(1)$. If $G$ is a maximal class $p$-group that is normally monomial or has at most three character degrees, then the codegrees of $G$ are consecutive powers of $p$. If $|G|=p^{n}$ and $G$ has consecutive $p$-power codegrees up to $p^{n-1}$, then the nilpotence class of $G$ is at most 2 or $G$ has maximal class.


Sign in / Sign up

Export Citation Format

Share Document