Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-19T00:47:17.630Z Has data issue: false hasContentIssue false

Polynomials With {0, +1, -1} Coefficients and a Root Close to a Given Point

Published online by Cambridge University Press:  20 November 2018

Peter Borwein
Affiliation:
Centre for Experimental and Constructive Mathematics, Simon Fraser University, Burnaby, BC, Canada
Christopher Pinner
Affiliation:
Centre for Experimental and Constructive Mathematics, Simon Fraser University, Burnaby, BC, Canada
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For a fixed algebraic number α we discuss how closely α can be approximated by a root of a {0, +1, -1} polynomial of given degree. We show that the worst rate of approximation tends to occur for roots of unity, particularly those of small degree. For roots of unity these bounds depend on the order of vanishing, k, of the polynomial at α.

In particular we obtain the following. Let BN denote the set of roots of all {0, +1, -1} polynomials of degree at most N and BN(α k) the roots of those polynomials that have a root of order at most k at α. For a Pisot number α in (1, 2] we show that

and for a root of unity α that

We study in detail the case of α = 1, where, by far, the best approximations are real. We give fairly precise bounds on the closest real root to 1. When k = 0 or 1 we can describe the extremal polynomials explicitly.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1997