Faber polynomials corresponding to rational exterior mapping functions of degree (m,m − 1) are studied. It is shown that these polynomials always satisfy an (m + 1)-term recurrence. For the special case m = 2, it is shown that the Faber polynomials can be expressed in terms of the classical Chebyshev polynomials of the first kind. In this case, explicit formulas for the Faber polynomials are de...

License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We consider meromorphic starlike univalent functions that are also bi-starlike and find Faber polynomial coefficient estimates for these types of functions. A function is said to be bi-starlike if both the function and its inverse are starlike univalent. Consider ...

The Faber polynomials for a region of the complex plane, which are of interest as a basis for polynomial approximation of analytic functions, are determined by a conformai mapping of the complement of that region to the complement of the unit disc. We derive this conformai mapping for a circular sector {;: \z\ < 1, |argz| < i/a}, where a > 1, and obtain a recurrence relation for the coefficient...

We study the asymptotic distribution of zeros for the random polynomials Pn(z) = ∑n k=0 AkBk(z), where {Ak}k=0 are non-trivial i.i.d. complex random variables. Polynomials {Bk}k=0 are deterministic, and are selected from a standard basis such as Szegő, Bergman, or Faber polynomials associated with a Jordan domain G bounded by an analytic curve. We show that the zero counting measures of Pn conv...

It is shown that the zeros of the Faber polynomials generated by a regular m-star are located on the m-star. This proves a recent conjecture of J. Bartolomeo and M. He. The proof uses the connection between zeros of Faber polynomials and Chebyshev quadrature formulas.

This talk connects simple lattice path enumeration with a subgroup of the Riordan group, ordered trees, and the Faber polynomials from classical complex analysis. The main tools employed are matrix multiplication, generating functions and a few definitions from group theory and complex functions.

Faber polynomials play an important role in different areas of constructive complex analysis. Here, the zeros and local extreme points of Faber polynomials for hypocycloidal domains are studied. For this task, we use tools from linear algebra, namely, the Perron-Frobenius theory of nonnegative matrices, the Gantmacher-Krein theory of oscillation matrices, and the Schmidt-Spitzer theory for the ...

We study asymptotic behavior of the derivatives of Faber polynomials on a set with corners at the boundary. Our results have applications to the questions of sharpness of Markov inequalities for such sets. In particular, the found asymptotics are related to a general Markov-type inequality of Pommerenke and the associated conjecture of Erdős. We also prove a new bound for Faber polynomials on p...