How to construct totally disconnected Markov sets? (Q540720): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:57, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to construct totally disconnected Markov sets? |
scientific article |
Statements
How to construct totally disconnected Markov sets? (English)
0 references
3 June 2011
0 references
The paper deals with the polynomial estimate on a compact planar set from a polynomial estimate on its circular projection. The main results are contained in Theorem 1.1 and Theorem 1.2, where the authors prove Markov and Bernstein-Walsh type inequalities. Interesting constructions of Markov sets are also presented. Finally the authors find a way for obtaining a family of perfect sets.
0 references
Markov inequality
0 references
exceptional sets
0 references
Leja-Siciak extremal function
0 references
Green function
0 references
iterated function systems
0 references
attractors
0 references
