Rank-boundedness conjecture for finite 2-groups with few rational characters
Statement
Let be a finite -group, let denote its rank, and let be the number of rational characters of . Rank-boundedness conjecture. The rank is -bounded, meaning that it is bounded above by a function depending only on . This is proposed as an analogue of a preceding result involving real characters; the source gives no resolution, so the boundedness assertion remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.