A graph associated with the \(\pi\)-character degrees of a group. (Q1413627): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Yakov G. Berkovich / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00013-003-0801-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022223289 / rank
 
Normal rank

Latest revision as of 18:42, 21 March 2024

scientific article
Language Label Description Also known as
English
A graph associated with the \(\pi\)-character degrees of a group.
scientific article

    Statements

    A graph associated with the \(\pi\)-character degrees of a group. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2003
    0 references
    Given \(G\) a finite group and \(\pi\) a set of primes, let \(\text{cd}^\pi(G)=\{\chi(1)\mid\chi\in\text{Irr}(G)\), \(\pi(\chi(1))\subseteq\pi\}\), where \(\pi(n)\) is the set of all prime divisors of \(n\in\mathbb{N}\). Let \(\Gamma^\pi(G)\) be the graph whose vertex set is \(\bigcup_{n\in\text{cd}^\pi(G)}\pi(n)\). There is an edge between \(p\) and \(q\) if \(pq\) divides a degree \(a\in\text{cd}^\pi(G)\). Main theorem. If \(G\) is a \(\pi\)-solvable group, then \(\Gamma^\pi\) has at most two connected components. -- In conclusion, some open questions are posed and discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    character degrees
    0 references
    graphs
    0 references
    \(\pi\)-solvable groups
    0 references
    connected components
    0 references
    0 references