Greatest Prime Divisors of Polynomial Values over Function Fields
classification
🧮 math.NT
keywords
functionfieldgreatestpolynomialprimeanalogueboundcertain
read the original abstract
For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong result for the function field analogue of a classical problem in number theory.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.