Character degree graphs, blocks and normal subgroups

From MaRDI portal
Publication:5314949





Given a finite group \(G\), a normal subgroup \(N\) of \(G\) and an irreducible character \(\theta\) of \(N\), the authors introduce the graph \(\Gamma(G|\theta)\), whose vertices are the prime numbers such that their product with \(\theta(1)\) divides the degree of any character of \(G\) lying above \(\theta\), and, two such primes are joined if their product with \(\theta(1)\) divides the degree of any such character. Defining the diameter of a disconnected graph to be the maximum of the diameters of its connected components, the authors prove the following results. \(\Gamma(G|\theta)\) has at most three connected components. Furthermore, if \(G/N\) is solvable then \(\Gamma(G|\theta)\) has at most two connected components and diameter at most \(4\). The case \(N=1\), \(\theta=1\) of these results was known [see \textit{I. M. Isaacs}, Trans. Am. Math. Soc. 356, No. 3, 1155-1183 (2004; Zbl 1034.20009) and \textit{P. P. Pálfy}, Period. Math. Hung. 36, No. 1, 61-65 (1998; Zbl 0930.20007)]. -- The authors also define a graph \(\Gamma(B)\) for a block \(B\) of \(G\), and they deduce that, for \(G\) solvable, \(\Gamma(B)\) has at most two connected components and diameter at most \(4\).











This page was built for publication: Character degree graphs, blocks and normal subgroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5314949)