On the Largest Irreducible Character Degree of a Finite Solvable Group

2010 ◽  
Vol 17 (spec01) ◽  
pp. 925-927 ◽  
Author(s):  
M. H. Jafari
Keyword(s):  
Finite Group ◽  
Wreath Product ◽  
Solvable Group ◽  
Irreducible Character ◽  
Prime Order ◽  
Character Degree ◽  
Finite Solvable Group ◽  
A Finite Group ◽  
Irreducible Character Degree

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.

The largest Irreducible Character Degree of a Finite Group

1985 ◽  
Vol 37 (3) ◽  
pp. 442-451 ◽  
Author(s):  
David Gluck
Keyword(s):  
Finite Group ◽  
Irreducible Character ◽  
Abelian Subgroup ◽  
Character Degree ◽  
Character Table ◽  
Significant Information ◽  
Famous Theorem ◽  
Frobenius Reciprocity ◽  
A Finite Group ◽  
Irreducible Character Degree

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.

scholarly journals A CHARACTERIZATION OF PSL(4,p) BY SOME CHARACTER DEGREE

2019 ◽  
pp. 679
Author(s):  
Younes Rezayi ◽  
Ali Iranmanesh
Keyword(s):  
Finite Group ◽  
Simple Group ◽  
Irreducible Character ◽  
Character Degree ◽  
A Finite Group ◽  
Irreducible Character Degree

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

The solvability comes from a given set of character degrees

2016 ◽  
Vol 15 (09) ◽  
pp. 1650164 ◽  
Author(s):  
Farideh Shafiei ◽  
Ali Iranmanesh
Keyword(s):  
Finite Group ◽  
Irreducible Character ◽  
Prime Power ◽  
Character Degree ◽  
Character Degrees ◽  
Degree Set ◽  
A Finite Group ◽  
Irreducible Character Degree

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

Character Degree Graphs of Solvable Groups of Fitting Height 2

2006 ◽  
Vol 49 (1) ◽  
pp. 127-133 ◽  
Author(s):  
Mark L. Lewis
Keyword(s):  
Finite Group ◽  
Solvable Group ◽  
Irreducible Character ◽  
Solvable Groups ◽  
Character Degree ◽  
Character Degrees ◽  
Irreducible Characters ◽  
Vertex Set ◽  
Fitting Height ◽  
A Finite Group

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.

On the 𝑝-closedness and 𝑝-nilpotency of finite groups

2019 ◽  
Vol 22 (5) ◽  
pp. 927-932
Author(s):  
Shuqin Dong ◽  
Hongfei Pan ◽  
Long Miao
Keyword(s):  
Finite Group ◽  
Conjugacy Class ◽  
Finite Groups ◽  
Irreducible Character ◽  
Class Size ◽  
Character Degree ◽  
Conjugacy Class Size ◽  
A Finite Group ◽  
Irreducible Character Degree

Abstract Let {\operatorname{acd}(G)} and {\operatorname{acs}(G)} denote the average irreducible character degree and the average conjugacy class size, respectively, of a finite group G. The object of this paper is to prove that if \operatorname{acd}(G)<2(p+1)/(p+3) , then G=O_{p}(G)\times O_{{p^{\prime}}}(G) , and that if \operatorname{acs}(G)<4p/(p\kern-1.0pt+\kern-1.0pt3) , then G=O_{p}(G)\kern-1.0pt\times\kern-1.0ptO_{{p^{\prime}}}(G) with {O_{p}(G)} abelian, where p is a prime.

𝒫-characters and the structure of finite solvable groups

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jiakuan Lu ◽  
Kaisun Wu ◽  
Wei Meng
Keyword(s):  
Finite Group ◽  
Maximal Subgroup ◽  
Solvable Group ◽  
Irreducible Character ◽  
Solvable Groups ◽  
Irreducible Constituent ◽  
A Finite Group

AbstractLet 𝐺 be a finite group. An irreducible character of 𝐺 is called a 𝒫-character if it is an irreducible constituent of (1_{H})^{G} for some maximal subgroup 𝐻 of 𝐺. In this paper, we obtain some conditions for a solvable group 𝐺 to be 𝑝-nilpotent or 𝑝-closed in terms of 𝒫-characters.

scholarly journals Frobenius action on Carter subgroups

2020 ◽  
Vol 30 (05) ◽  
pp. 1073-1080
Author(s):  
Güli̇n Ercan ◽  
İsmai̇l Ş. Güloğlu
Keyword(s):  
Finite Group ◽  
Solvable Group ◽  
Semidirect Product ◽  
Frobenius Group ◽  
Product Formula ◽  
Finite Solvable Group ◽  
Carter Subgroup ◽  
Text Length ◽  
Fitting Height ◽  
A Finite Group

Let [Formula: see text] be a finite solvable group and [Formula: see text] be a subgroup of [Formula: see text]. Suppose that there exists an [Formula: see text]-invariant Carter subgroup [Formula: see text] of [Formula: see text] such that the semidirect product [Formula: see text] is a Frobenius group with kernel [Formula: see text] and complement [Formula: see text]. We prove that the terms of the Fitting series of [Formula: see text] are obtained as the intersection of [Formula: see text] with the corresponding terms of the Fitting series of [Formula: see text], and the Fitting height of [Formula: see text] may exceed the Fitting height of [Formula: see text] by at most one. As a corollary it is shown that for any set of primes [Formula: see text], the terms of the [Formula: see text]-series of [Formula: see text] are obtained as the intersection of [Formula: see text] with the corresponding terms of the [Formula: see text]-series of [Formula: see text], and the [Formula: see text]-length of [Formula: see text] may exceed the [Formula: see text]-length of [Formula: see text] by at most one. These theorems generalize the main results in [E. I. Khukhro, Fitting height of a finite group with a Frobenius group of automorphisms, J. Algebra 366 (2012) 1–11] obtained by Khukhro.

scholarly journals A Note on a Conjecture of Brauer

1963 ◽  
Vol 22 ◽  
pp. 1-13 ◽  
Author(s):  
Paul Fong
Keyword(s):  
Finite Group ◽  
Prime Number ◽  
Solvable Group ◽  
Prime Divisor ◽  
Irreducible Character ◽  
Defect Group ◽  
Irreducible Characters ◽  
A Finite Group

In [1] R. Brauer asked the following question: Let be a finite group, p a rational prime number, and B a p-block of with defect d and defect group . Is it true that is abelian if and only if every irreducible character in B has height 0 ? The present results on this problem are quite incomplete. If d-0, 1, 2 the conjecture was proved by Brauer and Feit, [4] Theorem 2. They also showed that if is cyclic, then no characters of positive height appear in B. If is normal in , the conjecture was proved by W. Reynolds and M. Suzuki, [12]. In this paper we shall show that for a solvable group , the conjecture is true for the largest prime divisor p of the order of . Actually, one half of this has already been proved in [7]. There it was shown that if is a p-solvable group, where p is any prime, and if is abelian, then the condition on the irreducible characters in B is satisfied.

BOUNDING THE NUMBER OF IRREDUCIBLE CHARACTER DEGREES OF A FINITE GROUP IN TERMS OF THE LARGEST DEGREE

2013 ◽  
Vol 13 (02) ◽  
pp. 1350096 ◽  
Author(s):  
MARK L. LEWIS ◽  
ALEXANDER MORETÓ
Keyword(s):  
Finite Group ◽  
Irreducible Character ◽  
Character Degree ◽  
Character Degrees ◽  
Character Degree Graph ◽  
Prime Factors ◽  
Degree Graph ◽  
A Finite Group

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.

Sign in / Sign up

Export Citation Format

Share Document