Characterization of some simple groups by the multiplicity pattern. (Q382224): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finite nonsolvable groups in which only two nonlinear irreducible characters have equal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex group algebras of finite groups: Brauer's problem 1. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple groups which are determined by the set of their character degrees. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple groups which are determined by the set of their character degrees. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of degree graphs of nonsolvable groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of degree graphs of nonsolvable groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsolvable groups with few character degrees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of doubly transitive groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple classical groups of Lie type are determined by their character degrees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Huppert's conjecture for \(G_2(q)\), \(q\geq 7\). / rank
 
Normal rank

Revision as of 01:28, 7 July 2024

scientific article
Language Label Description Also known as
English
Characterization of some simple groups by the multiplicity pattern.
scientific article

    Statements

    Characterization of some simple groups by the multiplicity pattern. (English)
    0 references
    0 references
    18 November 2013
    0 references
    Let \(G\) be a finite group. Denote by \(m_G(d)\) the number of complex irreducible characters of \(G\) having the same degree \(d\). The set of irreducible characters of \(G\) is denoted by \(\text{cd}(G)=\{d_0,d_1,\ldots,d_k\}\) where \(1=d_0<d_1<\cdots<d_k\). The multiplicity pattern of \(G\) is defined to be the vector \(\text{mp}(G)=(m_G(d_0),m_G(d_1),\ldots,m_G(d_k))\). The author of the paper under review puts forward the following conjecture: Conjecture: Let \(G\) be a group and let \(H\) be a non-Abelian simple group. If \(\text{mp}(G)=\text{mp}(H)\), then \(G\) is isomorphic to \(H\). Then the author verifies the above conjecture for all non-Abelian simple groups with at most seven distinct character degrees.
    0 references
    numbers of complex irreducible characters
    0 references
    character degrees
    0 references
    finite simple groups
    0 references
    multiplicity patterns
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references