Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Reciprocal polynomials having small measure
HTML articles powered by AMS MathViewer

by David W. Boyd PDF
Math. Comp. 35 (1980), 1361-1377 Request permission


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.
Similar Articles
Additional Information
  • © Copyright 1980 American Mathematical Society
  • Journal: Math. Comp. 35 (1980), 1361-1377
  • MSC: Primary 30C15; Secondary 12-04, 26C05, 65D20
  • DOI:
  • MathSciNet review: 583514