Harbater's generator-rank conjecture for arithmetic fundamental groups
Statement
In the arithmetic case, let for a positive square-free integer , and let denote the groups occurring as Galois groups over with the specified tame ramification condition. Harbater's conjecture. There is a constant such that, for every positive square-free integer , every group in has a generating set with at most elements. This conjecture predicts a logarithmic bound on the generator rank of finite Galois groups subject to ramification restrictions, reflecting the analogy between arithmetic and function-field fundamental groups.
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.