2000 character limit reached
Explicit Hilbert's Irreducibility Theorem in Function Fields
Published 11 Dec 2019 in math.NT | (1912.05162v1)
Abstract: We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$, then the proportion of $n$-tuples $(t_1,\ldots, t_n)$ of monic polynomials of degree $d$ for which $f(t_1,\ldots, t_n,X)$ is reducible out of all $n$-tuples of degree $d$ monic polynomials is $O(dq{-d/2})$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.