Common zeros of irreducible characters (Q6622307)

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 7929534
Language Label Description Also known as
default for all languages
No label defined
    English
    Common zeros of irreducible characters
    scientific article; zbMATH DE number 7929534

      Statements

      Common zeros of irreducible characters (English)
      0 references
      0 references
      0 references
      0 references
      22 October 2024
      0 references
      The authors study the question: when do two non-linear irreducible characters of a finite group have a common zero? It is shown that in the symmetric group on \(n\geq 8\) elements, with one exception, any two nonlinear irreducible characters have at least one common zero. For a finite group \(G\) in general, let \(\Gamma_v(G)\) be the graph whose vertices are the nonlinear irreducible characters of \(G\), and two characters are joined by an edge if they have a common zero in \(G\). It is shown that for solvable groups \(G\), the graph \(\Gamma_v(G)\) has at most two connected components, and for simple groups, \(\Gamma_v(G)\) has at most three connected components. It is conjectured that this holds for all finite groups. The authors also discuss connections between \(\Gamma_v(G)\) and the common-divisor graph \(\Gamma(G)\), where two irreducible characters (as vertices) are joined by an edge if their degrees are not coprime.
      0 references
      characters of finite groups
      0 references
      zeros of characters
      0 references
      finite simple groups
      0 references
      symmetric groups
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references