English

Exact and approximate solutions to the minimum of $1+x+\cdots+x^{2n}$

History and Overview 2021-09-16 v4 Classical Analysis and ODEs

Abstract

The polynomial f2n(x)=1+x++x2nf_{2n}(x)=1+x+\cdots+x^{2n} and its minimizer on the real line x2n=arg inff2n(x)x_{2n}=\operatorname{arg\,inf} f_{2n}(x) for nNn\in\Bbb N are studied. Results show that x2nx_{2n} exists, is unique, corresponds to xf2n(x)=0\partial_x f_{2n}(x)=0, and resides on the interval [1,1/2][-1,-1/2] for all nn. It is further shown that inff2n(x)=(1+2n)/(1+2n(1x2n))\inf f_{2n}(x)=(1+2n)/(1+2n(1-x_{2n})) and inff2n(x)[1/2,3/4]\inf f_{2n}(x)\in[1/2,3/4] for all nn with an exact solution for x2nx_{2n} given in the form of a finite sum of hypergeometric functions of unity argument. Perturbation theory is applied to generate rapidly converging and asymptotically exact approximations to x2nx_{2n}. Numerical studies are carried out to show how many terms of the perturbation expansion for x2nx_{2n} are needed to obtain suitably accurate approximations to the exact value.

Keywords

Cite

@article{arxiv.2105.00135,
  title  = {Exact and approximate solutions to the minimum of $1+x+\cdots+x^{2n}$},
  author = {Aaron Hendrickson and Claude F. Leibovici},
  journal= {arXiv preprint arXiv:2105.00135},
  year   = {2021}
}

Comments

12 pages, 2 figures