Extremal polynomials and sets of minimal capacity (Q6892159)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8129412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal polynomials and sets of minimal capacity |
scientific article; zbMATH DE number 8129412 |
Statements
Extremal polynomials and sets of minimal capacity (English)
0 references
1 December 2025
0 references
For a compact set \(E\) with logarithmic capacity \(\operatorname{Cap}(E)>0\), let \(T_n^E\) be the Chebyshev polynomial of degree \(n\) on \(E\) and define the so-called Widom factor\N\[\N\mathcal{W}_n(E):=\frac{{\|T_n\|}_{E}}{\operatorname{Cap}(E)^n},\N\]\Nwhere \({\|\cdot\|}_{E}\) denotes the supremum norm on \(E\). One first result is a supplement of a result of [\textit{G. Alpan}, J. Approx. Theory 276, Article ID 105708, 8 p. (2022; Zbl 1501.30011)]: Let \(E\) be a Jordan arc of class \(C^{2+\varepsilon}\). Then\N\[\N\limsup_{n\to\infty}\mathcal{W}_n(E)\leq2\N\]\Nand equality holds if and only if \(E\) is a straight line segment. Only the part ``equality implies that \(E\) is a line segment'' is new and is proved by a simple argument using the S-property and the notion of Chebotarev sets. This result motivates the authors to investigate whether there are other examples of sets \(E\) for which \(\lim_{n\to\infty}\mathcal{W}_n(E)=2\). Besides others, they consider the set\N\[\NE_m:=\bigl\{z\in{\mathbb C}:z^m\in[-2,2]\bigr\}\N\]\Nand prove that \(\lim_{n\to\infty}\mathcal{W}_n(E_m)=2\).
0 references
Chebyshev polynomials
0 references
Widom factors
0 references
polynomial preimages
0 references
star graphs
0 references
0 references
0 references
0 references
0 references
0 references