For a finite group G, let r(G) be the minimum number of relations in a discrete presentation and let r-hat(G) be the corresponding minimum for a profinite presentation.
Statement
For a finite group G, let r(G) be the minimum number of relations in a discrete presentation and let r-hat(G) be the corresponding minimum for a profinite presentation. Is r(G) = r-hat(G) for every finite group? The report states that this equality is unknown.
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.