Counting characters in blocks with cyclic defect groups. I (Q1355556): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q173435
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Burkhard Külshammer / rank
 
Normal rank

Revision as of 04:20, 10 February 2024

scientific article
Language Label Description Also known as
English
Counting characters in blocks with cyclic defect groups. I
scientific article

    Statements

    Counting characters in blocks with cyclic defect groups. I (English)
    0 references
    0 references
    2 November 1997
    0 references
    One of the most intruiging problems in modular representation theory is Dade's conjecture relating the number of irreducible characters with a given defect in a given \(p\)-block \(B\) of a finite group \(G\) to the numbers of such characters with the same defect in corresponding blocks of certain \(p\)-local subgroups of \(G\). This conjecture generalizes both the Alperin-McKay conjecture on characters of height zero and Alperin's weight conjecture (in the Knörr-Robinson formulation). Actually, there are different forms of Dade's conjecture. In the paper under review, one of these forms, the ``invariant projective conjecture'' is shown to hold for blocks with cyclic defect groups. (This is not the strongest form of the conjecture. The author announces that this stronger form, the ``inductive conjecture'' is also valid for blocks with cyclic defect groups. The author intends to prove this in part II of this paper).
    0 references
    \(p\)-blocks
    0 references
    \(p\)-local subgroups
    0 references
    Dade's conjecture
    0 references
    numbers of irreducible characters
    0 references
    finite groups
    0 references
    Alperin-McKay conjecture
    0 references
    characters of height zero
    0 references
    Alperin's weight conjecture
    0 references
    blocks with cyclic defect groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references