Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Reciprocal polynomials having small measure

Author: David W. Boyd
Journal: Math. Comp. 35 (1980), 1361-1377
MSC: Primary 30C15; Secondary 12-04, 26C05, 65D20
MathSciNet review: 583514
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The measure of a monic polynomial is the product of the absolute value of the roots which lie outside and on the unit circle. We describe an algorithm, based on the root-squaring method of Graeffe, for finding all polynomials with integer coefficients whose measures and degrees are smaller than some previously given bounds. Using the algorithm, we find all such polynomials of degree at most 16 whose measures are at most 1.3. We also find all polynomials of height 1 and degree at most 26 whose measures satisfy this bound. Our results lend some support to Lehmer’s conjecture. In particular, we find no noncyclotomic polynomial whose measure is less than the degree 10 example given by Lehmer in 1933.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 30C15, 12-04, 26C05, 65D20

Retrieve articles in all journals with MSC: 30C15, 12-04, 26C05, 65D20

Additional Information

Article copyright: © Copyright 1980 American Mathematical Society