Polynomials With {0, +1, -1} Coefficients and a Root Close to a Given Point
A \(\{0,+1,-1\}\) polynomial is one with all coefficients in the set \(\{0,+1,-1\}\). Let \({\mathcal B}_N\) be the set of roots of all \(\{0,+1,-1\}\) polynomials of degree at most \(N\). Motivated by the intriguing appearance of plots of the sets \({\mathcal B}_N\) for various \(N\), the authors are interested in how closely a given algebraic number \(\alpha\) can be approximated by numbers from \({\mathcal B}_N\). They prove that the worst rate of approximation tends to occur if \(\alpha\) is a root of unity. For example, they show that if \(\alpha\) is a Pisot number in \((1,2]\) then \[ \min_{\beta \in {\mathcal B}_N \setminus \{\alpha\}} \log | \alpha-\beta| \sim - (\log \alpha)N. \] This behaviour is typical for \(\alpha\) which are themselves roots of \(\{0,+1,-1\}\) polynomials or power series. However, for \(\alpha\) a root of unity one has \[ \min_{\beta \in {\mathcal B}_N \setminus \{\alpha\}} \log | \alpha-\beta| \gg - \sqrt{N} \log N. \] The cases \(\alpha = \pm 1\) are considered in more detail and the behaviour contrasted with approximation by roots of \(\{-1,+1\}\) polynomials and \(\{0,1\}\) polynomials (see p. 898).
- Polynomials with a root close to an integer
- Zeros of polynomials with 0, 1 coefficients
- The nearest polynomial to multiple given polynomials with a given zero
- Polynomials whose coefficients coincide with their zeros
- The nearest polynomial with a zero in a given domain
- scientific article; zbMATH DE number 3152469
- The nearest polynomial with a given zero, revisited
- Polynomials with Nonnegative Coefficients Whose Zeros Have Modulus One
- The nearest polynomial to multiple given polynomials with a given zero in the real case
- On roots of polynomials with positive coefficients
- Roots of polynomials of bounded height
- Polynomials with a root close to an integer
- Approximation by polynomials with coefficients \(\pm 1\).
- Inner Bohemian inverses
- Upper Hessenberg and Toeplitz Bohemians
- Approximation by polynomials with bounded coefficients
- Explicit bounds for multidimensional linear recurrences with restricted coefficients
- Second-order bounds for linear recurrences with negative coefficients
- On Newman polynomials which divide no Littlewood polynomial
- On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk
- On experimental mathematics and mathematics education
- The Bohemian eigenvalue project
- On polynomials with only rational roots
- In memoriam: Peter Benjamin Borwein (1953--2020)
- Hole radii for the Kac polynomials and derivatives
- A bound for linear recurrence relations with unbounded order
- Bounds on coefficients of reciprocals of formal power series with rapidly decreasing coefficients
This page was built for publication: Polynomials With {0, +1, -1} Coefficients and a Root Close to a Given Point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385153)
