Beaucoup, Franck and Borwein, Peter and Boyd, David W. and Pinner, Christopher (1996) *Roots on a Ray: Power Series with Restricted Coefficients and a Root on a Given Ray.* [Preprint]

| Postscript Download (1243Kb) | Preview | |

| PDF Download (846Kb) | Preview |

## Abstract

We consider bounds on the smallest possible root with a specified argument $\phi$ of a power series $f(z)=1+{ \sum_{n=1}^{\infty}} a_{i}z^{i}$ with coefficients $a_{i}$ in the interval [-g,g]. We describe the form that the extremal power series must take and hence give an algorithm for computing the optimal root when $\phi/2\pi$ is rational. When $g\geq 2\sqrt{2}+3$ we show that the smallest disc containing two roots has radius $(\sqrt{g}+1)^{-1}$ coinciding with the smallest double real root possible for such a series. It is clear from our computations that the behaviour is more complicated for smaller $g$. We give a similar procedure for computing the smallest circle with a real root and a pair of conjugate roots of a given argument. We conclude by briefly discussing variants of the beta-numbers (where the defining integer sequence is generated by taking the nearest integer rather than the integer part). We show that the conjugates, $\lambda$, of these pseudo-beta-numbers either lie inside the unit circle or their reciprocals must be roots of $[-1/2,1/2)$ power series; in particular we obtain the sharp inequality $|\lambda |\leq 3/2$.

Item Type: | Preprint |
---|---|

Additional Information: | pubdom FALSE |

Uncontrolled Keywords: | power series, restricted coefficients, beta-numbers |

Subjects: | 30-xx Functions of a complex variable > 30Cxx Geometric function theory 12-xx Field theory and polynomials > 12Dxx Real and complex fields 30-xx Functions of a complex variable > 30Bxx Series expansion |

Faculty: | UNSPECIFIED |

Depositing User: | Users 1 not found. |

Date Deposited: | 17 Nov 2003 |

Last Modified: | 21 Apr 2010 11:13 |

URI: | https://docserver.carma.newcastle.edu.au/id/eprint/119 |

### Actions (login required)

View Item |