On the zero attractor of the Euler polynomials

  title={On the zero attractor of the Euler polynomials},
  author={Robert P. Boyer and William M. Y. Goh},
  journal={Adv. Appl. Math.},

Figures from this paper

On the attractor zero of a sequence of polynomials

The main perpose of this paper is to sudy the roots of a familly of polynomials that arise from a linear recurrences associated to Pascal's triangle and their zero attractor, using an analytical

Asymptotic behavior and zeros of the Bernoulli polynomials of the second kind

The main aim of this article is a careful investigation of the asymptotic behavior of zeros of Bernoulli polynomials of the second kind. It is shown that the zeros are all real and simple. The

Limit Curves for Zeros of Sections of Exponential Integrals

We are interested in studying the asymptotic behavior of the zeros of partial sums of power series for a family of entire functions defined by exponential integrals. The zeros grow on the order of

Asymptotic root distribution of Charlier polynomials with large negative parameter

. We analyze the asymptotic distribution of roots of Charlier polynomials with negative parameter depending linearly on the index. The roots cluster on curves in the complex plane. We determine

On the universal zero attractor of the Tribonacci-related polynomials

In this paper we solve a conjecture on the zeros of R-Bonacci polynomials in the case when r=3 (Tribonacci polynomials) and determine the zero attractor of the Tribonacci polynomials. Universality of

On the asymptotics of the rescaled Appell polynomials

Zeros of Sections of Some Power Series

For a power series which converges in some neighborhood of the origin in the complex plane, it turns out that the zeros of its partial sums---its sections---often behave in a controlled manner,



The Szego curve, zero distribution and weighted approximation

In 1924, Szegő showed that the zeros of the normalized partial sums, sn(nz), of ez tended to what is now called the Szegő curve S, where S := { z ∈ C : |ze1−z| = 1 and |z| ≤ 1 } . Using modern

On the Foundations of Combinatorial Theory

One of the most useful principles of enumeration in discrete probability and combinatorial theory is the celebrated principle of·inclusion-exclusion (ef. Feller*, FrEchet, Riordan, Ryser). When

Asymptotics and Special Functions

A classic reference, intended for graduate students mathematicians, physicists, and engineers, this book can be used both as the basis for instructional courses and as a reference tool.

Asymptotic Expansions—I

The interest in asymptotic analysis originated from the necessity of searching for approximations to functions close the point(s) of interest. Suppose we have a function f(x) of single real parameter

On arithmetic functions

Eg. π(n) = the number of primes ≤ n d(n) = the number of positive divisors of n σ(n) = the sum of the positive divisors of n σ k (n) = the sum of the kth powers of n ω(n) = the number of distinct

Generating functionology

On the foundations of combinatorial theory III

Univalent Functions

  • N. Ayırtman
  • Mathematics
    Series and Products in the Development of Mathematics
  • 1965