1998
DOI: 10.1017/cbo9780511526015
|View full text |Cite
|
Sign up to set email alerts
|

Characters and Blocks of Finite Groups

Abstract: This is a clear, accessible and up-to-date exposition of modular representation theory of finite groups from a character-theoretic viewpoint. After a short review of the necessary background material, the early chapters introduce Brauer characters and blocks and develop their basic properties. The next three chapters study and prove Brauer's first, second and third main theorems in turn. These results are then applied to prove a major application of finite groups, the Glauberman Z*-theorem. Later chapters exam… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
710
0

Year Published

2000
2000
2019
2019

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 325 publications
(711 citation statements)
references
References 0 publications
1
710
0
Order By: Relevance
“…Since |P | is even and q is odd, by Maschke's theorem, X F q is completely reducible, and moreover, is faithful since X is faithful. Using the FongSwan theorem [23,Theorem 10.1] on lifts of irreducible Brauer characters in solvable groups, we conclude that P has a complex faithful character, say χ, of degree n. Now we apply [12, Theorem A] to deduce that the number of generators in a minimal generating set for P , say d(P ), is at most (3/2)(n − s) + s, where s is the number of linear constituents of χ. In particular, d(P ) ≤ [3n/2], and it follows that…”
Section: Strongly Real Characters -Theorem 13mentioning
confidence: 99%
“…Since |P | is even and q is odd, by Maschke's theorem, X F q is completely reducible, and moreover, is faithful since X is faithful. Using the FongSwan theorem [23,Theorem 10.1] on lifts of irreducible Brauer characters in solvable groups, we conclude that P has a complex faithful character, say χ, of degree n. Now we apply [12, Theorem A] to deduce that the number of generators in a minimal generating set for P , say d(P ), is at most (3/2)(n − s) + s, where s is the number of linear constituents of χ. In particular, d(P ) ≤ [3n/2], and it follows that…”
Section: Strongly Real Characters -Theorem 13mentioning
confidence: 99%
“…For a given finite group G this defines IBr.G/, the set of irreducible p-Brauer characters of G, see [25,Chapter 2]. The quotient F D R=I is a field of characteristic p, and is the algebraic closure of its prime field F p .…”
Section: Preliminariesmentioning
confidence: 99%
“…For blocks and characters in general we use the notation as introduced in [13] and [25]. For a finite group G and any block b 2 Bl.G/ let b W Z.F G/ !…”
Section: Preliminariesmentioning
confidence: 99%
“…Let T be the stabilizer of y in G. Since P c T and T is Q-invariant, by the Cli¤ord correspondence, we may easily assume that y is G-invariant. Now, by using [20,Theorem 8.28] for the triple ðGQ; N; yÞ, we can easily assume that N is a central p 0 -subgroup of G centralized by Q.…”
Section: Proof Of Theorem Amentioning
confidence: 99%