The asymptotic size conjecture for the generating set of G(r,p)
Statement
Let be a prime, let be a positive integer, and let be the subgroup of generated by the elements for . Define
Generating-set size conjecture. The generating set has at most distinct elements for each prime , and
This concerns the size of the finite generating set obtained from the periodicity of the generators . The supplied text does not indicate whether the assertion has been proved or 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.