How to construct totally disconnected Markov sets?

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We deduce a polynomial estimate on a compact planar set from a polynomial estimate on its circular projection, which enables us to prove Markov and Bernstein-Walsh type inequalities for certain sets. We construct -totally disconnected Markov sets that are scattered around zero in different directions; -a Markov set E ⊂ ℝ such that neither E ∩ [0, +∞] nor E ∩ [-∞, 0] admit Markov's inequality;-a Markov set that is not uniformly perfect.Finally, we propose a construction based on a generalization of iterated function systems: a way of obtaining a big family of uniformly perfect sets. © 2010 Fondazione Annali di Matematica Pura ed Applicata and Springer-Verlag.

Cite

CITATION STYLE

APA

Białas-Ciez, L., & Kosek, M. (2011). How to construct totally disconnected Markov sets? Annali Di Matematica Pura Ed Applicata, 190(2), 209–224. https://doi.org/10.1007/s10231-010-0146-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free