ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MgM_g denote the maximum order of an extendable finite group action on a minimal graph of genus gg. Assume that gg is neither a square number nor one of the finitely many values listed in the preceding table. If gg is prime, then

Mg=4(g+1).M_g=4(g+1).

If gg is composite, write g=pqg=pq, where pp is the smallest nontrivial divisor of gg. Then

Mg=4(p+1)(q+1).M_g=4(p+1)(q+1).

Maximum-order conjecture. Under these hypotheses, MgM_g 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.