Maximum-order conjecture for extendable actions on minimal graphs
Statement
Let denote the maximum order of an extendable finite group action on a minimal graph of genus . Assume that is neither a square number nor one of the finitely many values listed in the preceding table. If is prime, then
If is composite, write , where is the smallest nontrivial divisor of . Then
Maximum-order conjecture. Under these hypotheses, has the values specified above. The claim concerns the still-unknown maximum orders of extendable finite group actions on minimal graphs, contrasting with the determined maximum orders for arbitrary graphs.
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.