Irreducible line sections: exact convention-sensitive counts and monodromy status
Statement
Question 6. Let f (X, Y ) ∈ Fq[X, Y ] be irreducible. Let g(Y ) = f (aY + b, Y ). Count (or estimate) the number of pairs a, b over Fq such that g is irreducible over Fq. (Gao)
Record
- Source
- Added
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.