Author:
Borwein Peter,Pinner Christopher
Abstract
AbstractFor 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 thatand for a root of unity α thatWe 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.
Publisher
Canadian Mathematical Society
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. In Memoriam: Peter Benjamin Borwein (1953–2020);Journal of Approximation Theory;2024-11
2. Hole radii for the Kac polynomials and derivatives;Stochastic Processes and their Applications;2024-09
3. On polynomials with only rational roots;Mathematika;2023-06-09
4. Bohemian Matrix Geometry;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04
5. Inner Bohemian inverses;Applied Mathematics and Computation;2022-05