Odd character correspondences in solvable groups. (Q2474480): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:34, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Odd character correspondences in solvable groups. |
scientific article |
Statements
Odd character correspondences in solvable groups. (English)
0 references
6 March 2008
0 references
This paper is part of an extensive study of the author on character correspondences related to the McKay Conjecture. Let \(G\) be a finite group, \(p\) a prime, \(P\in\text{Syl}_p(G)\) and \(N=N_G(P)\). The well-known McKay Conjecture states that if \(\text{Irr}_{p'}(G)\) is the set of irreducible (complex) characters of \(p'\)-degree of \(G\), then \(|\text{Irr}_{p'}(G)|=|\text{Irr}_{p'}(N)|\). Recent generalizations of the McKay Conjecture by Isaacs-Navarro, Navarro and the author suggest that there even is a bijection between \(\text{Irr}_{p'}(G)\) and \(\text{Irr}_{p'}(N)\) preserving many properties of the characters. In [J. Algebra 295, No. 1, 157-178 (2006; Zbl 1107.20008)] the author constructed the strongest of these conjectured bijections in case that \(G\) is solvable. In the paper under review, he establishes an even stronger bijection under the assumption that \(G\) is solvable and \(|N|\) is odd, namely one that preserves \(\pm\) the degree modulo \(p\), the fields of values, and the Schur index over every field of characteristic zero. As one consequence of this it is proved that if \(G\) is solvable, then \(G\) has a nontrivial rational irreducible character of \(p'\)-degree if and only if \(|N|\) is even.
0 references
finite groups
0 references
solvable groups
0 references
character correspondences
0 references
Clifford theory
0 references
Brauer groups
0 references
numbers of irreducible characters
0 references
fields of values
0 references
Schur indices
0 references
McKay conjecture
0 references
rational characters
0 references