Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups# (Q5707918)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2232587
Language Label Description Also known as
default for all languages
No label defined
    English
    Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups#
    scientific article; zbMATH DE number 2232587

      Statements

      Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups# (English)
      0 references
      0 references
      25 November 2005
      0 references
      character degrees
      0 references
      character degree graphs
      0 references
      normal subgroups
      0 references
      finite groups
      0 references
      connected components
      0 references
      Fitting heights
      0 references
      Let \(G\) be finite group and let \(N\) be a normal subgroup of \(G\). Let \(\text{cd}(G|N)\) be the set of the degrees of the irreducible characters of \(G\) whose kernels do not contain \(N\). A graph is associated with this set. The vertices of this graph are the primes dividing degrees in \(\text{cd}(G|N)\), and there is an edge between \(p\) and \(q\) if \(pq\) divides some degree in \(\text{cd}(G|N)\). In this paper, this graph is studied when it is disconnected, and its diameter when it is connected. The paper contains a lot of interesting results, among them centering around so-called ``groups of disconnected type'', view \textit{M. L. Lewis} [J. Group Theory 4, No. 3, 255-275 (2001; Zbl 0998.20009)]. From the paper under review, we now quote some of the main results. Theorem A. Let \(N\triangleleft G\). Then \(\Delta(G/N)\) has at most three connected components. If \(G''<G'\), then \(\Delta(G/N)\) has at most two connected components. Theorem B. Given a group \(G\), there exists \(N\triangleleft G\) with \(\Delta(G/N)\) disconnected if and only if either 1. \(\Delta(G)\) is disconnected, or 2. \(G\) is of disconnected type. Corollary C. Suppose \(G\) is solvable, with \(N\triangleleft G\) so that \(\Delta(G/N)\) is disconnected. Then \(G\) has Fitting height at most 4, \(\Delta(G/N)\) has at most two connected components, and each connected component is a complete graph. Theorem B has many consequences which are also shown in this paper. Lack of space prohibits the reviewer to state more results of this very interesting paper. To close with, we furnish the definition of \(\Delta(X)\) for a finite group \(X\), used above. Namely, let \(\text{cd}(X)=\{\chi(1)\mid\chi\in\text{Irr}(X)\}\), let \(\rho(\text{cd}(X))\) be the set of primes dividing some element of \(\text{cd}(X)\); define the graph \(\Delta(\text{cd}(X))\) with \(\rho(\text{cd}(X))\) as vertices, saying that there is an edge between the primes \(p\) and \(q\) if \(pq\) divides some element of \(\text{cd}(X)\). Now put shortly \(\Delta(X)=\Delta(\text{cd}(X))\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references