2000 character limit reached
Degree divisibility in Alperin-McKay correspondences
Published 21 Apr 2022 in math.RT and math.GR | (2204.10124v3)
Abstract: Let p be a prime, B a p-block of a finite group G and b its Brauer correspondent. According to the Alperin-McKay Conjecture, there exists a bijection between the set of irreducible ordinary characters of height zero of B and those of b. In this paper, we show that whenever G is p-solvable such a bijection can be found, both for ordinary and Brauer characters, with the additional property of being compatible with divisibility of character degrees. In this case, we also show that the dimension of b divides the dimension of B.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.