Murray, John
(1998)
Dade's Conjecture for the McLaughlin Simple Group.
PhD thesis, University of Illinois at UrbanaChampaign.
Abstract
In [Da92] E.C. Dade announced the first of what was to be a series of conjectures concerned with counting characters in the blocks of finite groups. Specifically, Dade's socalled Ordinary Conjecture asserts that if a finite group G has trivial pcore, and B is a pblock of G of positive defect, then the number k(B,d) of complex irreducible characters with fixed defect d belonging to B can be expressed a an alternating sum over the corresponding numbers for the normalizers of the nontrivial pchains of G. Refined versions of this conjecture have been given in subsequent articles. See [Da94] and [DaPr] for further details. Dade claims that the strongest form of his conjectures is true for all finite groups if it is true for all covering groups of finite simple groups. Thus, in order to prove his conjectures, one merely has to go through the complete list of finite simple groups, carefully verifying that the strongest form holds for each one. In this Thesis we prove the most general version of Dade's Conjectures for all covering groups of the McLaughlin group Mc. This is one of the 26 sporadic simple groups. So our Thesis forms a portion of the as yet incomplete proof of Dade's Conjectures for all finite groups.
Item Type: 
Thesis
(PhD)

Keywords: 
Dade's Conjecture; McLaughlin Simple Group;

Subjects: 
Science & Engineering > Mathematics 
Item ID: 
2057 
Depositing User: 
Dr. John Murray

Date Deposited: 
20 Jul 2010 15:28 
URI: 

Repository Staff Only(login required)

Item control page 