AbstractLet d be the degree of some irreducible character of a finite group G. We can write |G|=d(d+e) for some nonnegative integer e, and we show that if e>1, then |G|⩽Be6 for some universal constant B. This result, which improves a non-polynomial bound of Snyder, relies on recent work of Larsen, Malle and Tiep on character degrees of simple groups, and so it uses the simple group classification
Abstract. Let G be a finite group. We denote by ρ(G) the set of primes which divide some character d...
A classical theorem on character degrees states that if a finite group has fewer than four character...
Abstract. Let G be a nite metabelian p-group whose non-linear irreducible character degrees lie betw...
AbstractLet d be the degree of an irreducible character of a finite group G. We can write |G|=d(d+e)...
AbstractLet d be the degree of some irreducible character of a finite group G. We can write |G|=d(d+...
AbstractIt has been proved recently by Moretó (2007) [8] and Craven (2008) [3] that the order of a f...
summary:The character degree graph of a finite group $G$ is the graph whose vertices are the prime d...
Let G be a finite group, and let cd(G) denote the set of degrees of the irreducible complex characte...
AbstractLet P be a Sylow p-subgroup and b(G) the largest irreducible character degree of a finite gr...
Let F(G) and b(G) respectively denote the Fitting subgroup and the largest degree of an irreducible ...
AbstractWe call m is a Hall-number for G if m is the order of a Hall subgroup of G, that is, gcd(|G|...
This paper concerns the arithmetical structure of the character degrees of a finite group. A useful ...
We consider sequences of degrees of ordinary irreducible Sncharacters. We assume that the correspond...
AbstractFinite groups with the nonlinear irreducible characters of distinct degrees, were classified...
We develop the concept of character level for the complex irreducible characters of finite, general ...
Abstract. Let G be a finite group. We denote by ρ(G) the set of primes which divide some character d...
A classical theorem on character degrees states that if a finite group has fewer than four character...
Abstract. Let G be a nite metabelian p-group whose non-linear irreducible character degrees lie betw...
AbstractLet d be the degree of an irreducible character of a finite group G. We can write |G|=d(d+e)...
AbstractLet d be the degree of some irreducible character of a finite group G. We can write |G|=d(d+...
AbstractIt has been proved recently by Moretó (2007) [8] and Craven (2008) [3] that the order of a f...
summary:The character degree graph of a finite group $G$ is the graph whose vertices are the prime d...
Let G be a finite group, and let cd(G) denote the set of degrees of the irreducible complex characte...
AbstractLet P be a Sylow p-subgroup and b(G) the largest irreducible character degree of a finite gr...
Let F(G) and b(G) respectively denote the Fitting subgroup and the largest degree of an irreducible ...
AbstractWe call m is a Hall-number for G if m is the order of a Hall subgroup of G, that is, gcd(|G|...
This paper concerns the arithmetical structure of the character degrees of a finite group. A useful ...
We consider sequences of degrees of ordinary irreducible Sncharacters. We assume that the correspond...
AbstractFinite groups with the nonlinear irreducible characters of distinct degrees, were classified...
We develop the concept of character level for the complex irreducible characters of finite, general ...
Abstract. Let G be a finite group. We denote by ρ(G) the set of primes which divide some character d...
A classical theorem on character degrees states that if a finite group has fewer than four character...
Abstract. Let G be a nite metabelian p-group whose non-linear irreducible character degrees lie betw...
DOI
Add to ORKG