Greatest Prime Divisors of Polynomial Values over Function Fields

2013/07/02 by Alexei Entin, Entin, Alexei
Mathematics · #FOS: Mathematics #Number Theory (math.NT) #math.NT

paper · pdf · doi:10.48550/arxiv.1307.0766

arxiv created 2013/08/14 · arxiv updated 2013/08/15

Abstract

For a function field K and fixed polynomial F∈ K[x] and varying f∈ 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.

Related

• Prime divisors in polynomial orbits over function fields
• Arithmetic Problems in Cubic and Quartic Function Fields
• Lower bounds on the class number of algebraic function fields defined over any finite field
• Square-free values of polynomials evaluated at primes over a function\n field
• Prime polynomial values of linear functions in short intervals