2000 character limit reached
On Lehmer's Conjecture for Polynomials and for Elliptic Curves
Published 21 Aug 2010 in math.NT | (1008.3649v1)
Abstract: A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of the form 1+X+...+Xn for some n > \epsilon*deg(f). We also formulate and prove an analogous statement for elliptic curves.
Paper Prompts
Sign up for free to create and run prompts on this paper.