location:  Publications → journals
Search results

Search: MSC category 30C10 ( Polynomials )

 Expand all        Collapse all Results 1 - 2 of 2

1. CJM Online first

Günther, Christian; Schmidt, Kai-Uwe
 $L^q$ norms of Fekete and related polynomials A Littlewood polynomial is a polynomial in $\mathbb{C}[z]$ having all of its coefficients in $\{-1,1\}$. There are various old unsolved problems, mostly due to Littlewood and ErdÅs, that ask for Littlewood polynomials that provide a good approximation to a function that is constant on the complex unit circle, and in particular have small $L^q$ norm on the complex unit circle. We consider the Fekete polynomials $f_p(z)=\sum_{j=1}^{p-1}(j\,|\,p)\,z^j,$ where $p$ is an odd prime and $(\,\cdot\,|\,p)$ is the Legendre symbol (so that $z^{-1}f_p(z)$ is a Littlewood polynomial). We give explicit and recursive formulas for the limit of the ratio of $L^q$ and $L^2$ norm of $f_p$ when $q$ is an even positive integer and $p\to\infty$. To our knowledge, these are the first results that give these limiting values for specific sequences of nontrivial Littlewood polynomials and infinitely many $q$. Similar results are given for polynomials obtained by cyclically permuting the coefficients of Fekete polynomials and for Littlewood polynomials whose coefficients are obtained from additive characters of finite fields. These results vastly generalise earlier results on the $L^4$ norm of these polynomials. Keywords:character polynomial, Fekete polynomial, $L^q$ norm, Littlewood polynomialCategories:11B83, 42A05, 30C10

2. CJM 1997 (vol 49 pp. 887)

Borwein, Peter; Pinner, Christopher
 Polynomials with $\{ 0, +1, -1\}$ coefficients and a root close to a given point For a fixed algebraic number $\alpha$ we discuss how closely $\alpha$ 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 $\alpha$. In particular we obtain the following. Let ${\cal B}_{N}$ denote the set of roots of all $\{0,+1,-1\}$ polynomials of degree at most $N$ and ${\cal B}_{N}(\alpha,k)$ the roots of those polynomials that have a root of order at most $k$ at $\alpha$. For a Pisot number $\alpha$ in $(1,2]$ we show that $\min_{\beta \in {\cal B}_{N}\setminus \{ \alpha \}} |\alpha -\beta| \asymp \frac{1}{\alpha^{N}},$ and for a root of unity $\alpha$ that $\min_{\beta \in {\cal B}_{N}(\alpha,k)\setminus \{\alpha\}} |\alpha -\beta|\asymp \frac{1}{N^{(k+1) \left\lceil \frac{1}{2}\phi (d)\right\rceil +1}}.$ We study in detail the case of $\alpha=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. Keywords:Mahler measure, zero one polynomials, Pisot numbers, root separationCategories:11J68, 30C10
 top of page | contact us | privacy | site map |