Reciprocal Polynomials Having Small Measure
- 1 October 1980
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 35 (152) , 1361-1377
- https://doi.org/10.2307/2006402
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.Keywords
This publication has 10 references indexed in Scilit:
- On an Inequality of J. Vicente GonçalvesPublished by Springer Nature ,1983
- Variations on a Theme of KroneckerCanadian Mathematical Bulletin, 1978
- Small Salem numbersDuke Mathematical Journal, 1977
- On a question of Lehmer and the number of irreducible factors of a polynomialActa Arithmetica, 1977
- On the Product of the Conjugates outside the unit circle of an Algebraic IntegerBulletin of the London Mathematical Society, 1971
- Analytic InequalitiesPublished by Springer Nature ,1970
- Some Inequalities for PolynomialsThe American Mathematical Monthly, 1966
- Resultant Procedure and the Mechanization of the Graeffe ProcessJournal of the ACM, 1960
- Geometry of PolynomialsPublished by American Mathematical Society (AMS) ,1949
- Factorization of Certain Cyclotomic FunctionsAnnals of Mathematics, 1933