The elementary-abelian p-group complexity conjecture
Statement
Let be prime, let , and let denote the Gaussian binomial coefficient, counting the subgroups of isomorphic to . Let denote the complexity. Elementary-abelian complexity conjecture.
The conjecture is based on computational evidence and predicts a change in behavior at for even ranks.
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.