The extended formula conjecture for degree-refined unitriangular character counts
Statement
Let be a finite field with elements, and let denote the number of irreducible characters of of degree . For a positive integer and , define
Theorem 1 states that for , all integers , and prime powers ,
where each is a polynomial with nonnegative integer coefficients and is a nonnegative integer for every nonnegative integer . Extended formula conjecture. The displayed theorem holds for every positive integer . The formula is verified in the paper only for ; extending it to all positive is presented as a conjecture motivated by the observed polynomial pattern.
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.