2000 character limit reached
Rational representations and permutation representations of finite groups
Published 26 May 2014 in math.RT and math.GR | (1405.6616v2)
Abstract: We investigate the question which Q-valued characters and characters of Q-representations of finite groups are Z-linear combinations of permutation characters. This question is known to reduce to that for quasi-elementary groups, and we give a solution in that case. As one of the applications, we exhibit a family of simple groups with rational representations whose smallest multiple that is a permutation representation can be arbitrarily large.
Sponsor
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.