On the character degree graph of solvable groups

Let Γ be a finite simple graph. If for some integer Γ is a Kn -free graph whose complement has an odd cycle of length at least then we say that Γ is an n-exact graph. For a finite group G, let denote the character graph built on the set of degrees of the irreducible complex characters of G. In this paper, we prove that the order of an n-exact character graph is at most Also we determine the structure of all finite groups G with extremal n-exact character graph.

Let G be a finite group and let be the set of degrees of complex irreducible characters of G. An important program in character theory is to obtain the structure of G when is known. In this article, we consider a dual version of this approach. Indeed, we consider non-solvable groups with five character degrees and present a description of the set of character degrees for such groups. As an application of this result, it is shown that a finite group with five character degrees and containing no prime power must be a solvable group.

The prime graph \(\Delta (G)\) of a finite group \(G\) is a graph whose vertices are the primes which divide the degrees of some irreducible complex characters of \(G\) and two distinct primes \(p\) and \(q\) are joined by an edge if the product \(pq\) divides some character degree of \(G\). In this paper, we determine the upper bounds for the numbers of vertices of the prime graphs of finite groups which possess a small number of triangles. In some cases, we study the structure of such finite groups and their prime graphs in detail.

Let G be a finite group and let w A IrrðGÞ lie in a p-block of full defect for an odd prime p. We investigate mQðwÞp, the p-part of the rational Schur index of w. At the onset of this work, it was suspected that these Schur indices would not be divisible by p, and in Section 2 below, we show this to be the case when G is either supersolvable or p-nilpotent. Further motivation came from the situation in which G has a normal Sylow p-subgroup. Of course in this case all irreducible characters of G lie in p-blocks of full defect. Recall that a p-hyperelementary subgroup is a subgroup with a cyclic, normal p-complement and that by results of Brauer, Witt, and Berman G has a p-hyperelementary subgroup H with z A IrrðHÞ such that mQðwÞp divides mQðzÞ. If the Sylow p-subgroup of G is normal, all p-hyperelementary subgroups of G are nilpotent. Hence, the Schur indices of their irreducible characters are at most 2, and it follows that p does not divide mQðwÞ: One final case is that in which the Sylow p-subgroups of G are abelian. In this situation, Brauer’s height zero conjecture implies that the degrees of the irreducible characters in p-blocks of full defect are not divisible by p. Thus their Schur indices are not divisible by p either. However, in Section 3 we fix an a A N and construct a solvable group G with irreducible character w lying in the principal p-block of G=KerðwÞ and satisfying mQðwÞ 1⁄4 p. It is crucial to regard w as a faithful irreducible character of G=KerðwÞ, as one can always regard an irreducible character c of a group H as an irreducible character of a larger group G which surjects onto H. This does not a¤ect the Schur index of c, but it can easily be set up to ensure c lies in the principal p-block of G: The group SLð2; 3Þ has a rational-valued irreducible character w such that

Let \(G\) be a finite group. The character degree graph of \(G\), which is denoted by \(\Gamma (G)\), is the graph whose vertices are the prime divisors of the character degrees of the group \(G\) and two vertices \(p_1\) and \(p_2\) are joined by an edge if \(p_1p_2\) divides some character degree of \(G\). In this paper we prove that the simple group \(\mathrm{PSL}(2,p^2) \) is uniquely determined by its character degree graph and its order. Let \(X_1(G)\) be the set of all irreducible complex character degrees of \(G\) counting multiplicities. As a consequence of our results we prove that if \(G\) is a finite group such that \(X_1(G)=X_1(\mathrm{PSL}(2,p^2) )\), then \(G\cong \mathrm{PSL}(2,p^2) \). This implies that \(\mathrm{PSL}(2,p^2) \) is uniquely determined by the structure of its complex group algebra.

Let A be a finite group and let n be the number of primes, including multiplicities, which divide the order of A. Suppose further that G is a finite solvable group which admits A as a fixed-point-free operator group and such that (i A I, G|I ) = 1. Under these assumptions it has been conjectured that l(G), the nilpotent length of G, is at most n, while lp(G), the p-length of G, is at most [(n+1)/2]. These inequalities have been verified and shown to be best-possible in certain special cases ( [3 ][5], [1]). It is the purpose of this note to show that these conjectured upper bounds are actually obtained provided A is solvable. Specifically we will prove

Finite Solvable Groups in Which Only Two Nonlinear Irreducible Characters Have Equal Degrees

The aim of this paper is to prove certain characterization theorems for groups in which permutability is a transitive relation, the so called $${\mathcal{PT}}$$ -groups. In particular, it is shown that the finite solvable $${\mathcal{PT}}$$ -groups, the finite solvable groups in which every subnormal subgroup of defect two is permutable, the finite solvable groups in which every normal subgroup is permutable sensitive, and the finite solvable groups in which conjugate-permutability and permutability coincide are all one and the same class. This follows from our main result which says that the finite modular p-groups, p a prime, are those p-groups in which every subnormal subgroup of defect two is permutable or, equivalently, in which every normal subgroup is permutable sensitive. However, there exist finite insolvable groups which are not $${\mathcal{PT}}$$ -groups but all subnormal subgroups of defect two are permutable.

We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in $\Z_{p}^{n}$, whenever $p$ is a fixed prime. For the induction step, we introduce the problem Translating Coset generalizing both Hidden Translation and Hidden Subgroup, and prove a powerful self-reducibility result: Translating Coset in a finite solvable group $G$ is reducible to instances of Translating Coset in $G/N$ and $N$, for appropriate normal subgroups $N$ of $G$. Our self-reducibility framework combined with Kuperberg's subexponential quantum algorithm for solving Hidden Translation in any abelian group, leads to subexponential quantum algorithms for Hidden Translation and Hidden Subgroup in any solvable group.

We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in $\Z_{p}^{n}$, whenever $p$ is a fixed prime. For the induction step, we introduce the problem Translating Coset generalizing both Hidden Translation and Hidden Subgroup, and prove a powerful self-reducibility result: Translating Coset in a finite solvable group $G$ is reducible to instances of Translating Coset in $G/N$ and $N$, for appropriate normal subgroups $N$ of $G$. Our self-reducibility framework combined with Kuperberg's subexponential quantum algorithm for solving Hidden Translation in any abelian group, leads to subexponential quantum algorithms for Hidden Translation and Hidden Subgroup in any solvable group.

Regular and p-regular orbits of solvable linear groups

Let G be a finite group and let p be a prime. In this paper, we classify all finite quasisimple groups in which the degrees of all irreducible p-Brauer characters are prime powers. As an application, for a fixed odd prime p, we classify all finite nonsolvable groups with the above-mentioned property and having no nontrivial normal p-subgroups. Furthermore, for an arbitrary prime p, a complete classification of finite groups in which the degrees of all nonlinear irreducible p-Brauer characters are primes is also obtained.

Let G be a finite group, and let $$\textrm{cd}(G)$$ denote the set of degrees of the irreducible complex characters of G. Define then the character degree graph $$\Delta (G)$$ as the (simple undirected) graph whose vertices are the prime divisors of the numbers in $$\textrm{cd}(G)$$ , and two distinct vertices p, q are adjacent if and only if pq divides some number in $$\textrm{cd}(G)$$ . This paper continues the work, started in [8], toward the classification of the finite non-solvable groups whose degree graph possesses a cut-vertex, i.e. a vertex whose removal increases the number of connected components of the graph. While, in [8], groups with no composition factors isomorphic to $$\textrm{PSL}_{2}(t^a)$$ (for any prime power $$t^a\ge 4$$ ) were treated, here we consider the complementary situation in the case when $$t$$ is odd and $$t^a> 5$$ . The proof of this classification will be then completed in the third and last paper of this series [7] that deals with the case $$t=2$$ .

Simple classical groups of Lie type are determined by their character degrees

Blocks of small defect