1994
DOI: 10.1006/jath.1994.1087
|View full text |Cite
|
Sign up to set email alerts
|

The Zeros of Faber Polynomials for an m-Cusped Hypocycloid

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
39
0
2

Year Published

1996
1996
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 50 publications
(42 citation statements)
references
References 10 publications
1
39
0
2
Order By: Relevance
“…Some references on this subject are [1,2,10,26,31]. See also [13,18] for the related study of Faber polynomials associated with hypocycloidal domains and stars. Lemma 1.3 allows us to obtain the asymptotic properties of the polynomials P n,n through the analysis of a matrix-valued Riemann-Hilbert problem of size (d + 1) × (d + 1) that encodes the multiple orthogonality conditions (1.32).…”
Section: Orthogonality On (D + 1)-star and Multiple Orthogonalitymentioning
confidence: 99%
“…Some references on this subject are [1,2,10,26,31]. See also [13,18] for the related study of Faber polynomials associated with hypocycloidal domains and stars. Lemma 1.3 allows us to obtain the asymptotic properties of the polynomials P n,n through the analysis of a matrix-valued Riemann-Hilbert problem of size (d + 1) × (d + 1) that encodes the multiple orthogonality conditions (1.32).…”
Section: Orthogonality On (D + 1)-star and Multiple Orthogonalitymentioning
confidence: 99%
“…[10], Proposition 2.1) and that the associated Faber polynomials can be explicitly calculated (see e.g. [10], Proposition 2.3 and [11]).…”
Section: Applicationsmentioning
confidence: 99%
“…[10], Proposition 2.1) and that the associated Faber polynomials can be explicitly calculated (see e.g. [10], Proposition 2.3 and [11]). Without entering into details, in this case for the construction of the q-Stancu-Faber polynomials one relies on the calculation of the integrals in (2).…”
Section: Applicationsmentioning
confidence: 99%
“…This result is important for applications because for some f and K a computation of F n is more simple than p n (see Ellacott, 1983;Johnston, 1987;He and Saff, 1994;He, 1994;Coleman and Myers, 1995, and references therein).…”
mentioning
confidence: 93%