English

Root geometry of polynomial sequences I: Type $(0,1)$

Combinatorics 2015-01-27 v1

Abstract

This paper is concerned with the distribution in the complex plane of the roots of a polynomial sequence {Wn(x)}n0\{W_n(x)\}_{n\ge0} given by a recursion Wn(x)=aWn1(x)+(bx+c)Wn2(x)W_n(x)=aW_{n-1}(x)+(bx+c)W_{n-2}(x), with W0(x)=1W_0(x)=1 and W1(x)=t(xr)W_1(x)=t(x-r), where a>0a>0, b>0b>0, and c,t,rRc,t,r\in\mathbb{R}. Our results include proof of the distinct-real-rootedness of every such polynomial Wn(x)W_n(x), derivation of the best bound for the zero-set \{x\mid W_n(x)=0\ \text{for some n\ge1}\}, and determination of three precise limit points of this zero-set. Also, we give several applications from combinatorics and topological graph theory.

Keywords

Cite

@article{arxiv.1501.06107,
  title  = {Root geometry of polynomial sequences I: Type $(0,1)$},
  author = {J. L. Gross and T. Mansour and T. W. Tucker and D. G. L. Wang},
  journal= {arXiv preprint arXiv:1501.06107},
  year   = {2015}
}

Comments

24 pages, 1 figure

R2 v1 2026-06-22T08:12:13.519Z