Non-removability of Sierpinski carpets

نویسندگان

چکیده

We prove that all Sierpi\'nski carpets in the plane are non-removable for (quasi)conformal maps. More precisely, we show any two $S,S'\subset \hat{\mathbb{C}}$ there exists a homeomorphism $f\colon \hat{\mathbb{C}}\to is conformal $\hat{\mathbb{C}}\setminus S$ and it maps $S$ onto $S'$. The proof topological utilizes ideas of characterization Whyburn. As corollary, obtain partial answer to question Bishop, whether planar continuum with empty interior positive measure can be mapped set zero an exceptional plane, off set.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniqueness of Brownian motion on Sierpinski carpets

We prove that, up to scalar multiples, there exists only one local regular Dirichlet form on a generalized Sierpinski carpet that is invariant with respect to the local symmetries of the carpet. Consequently for each such fractal the law of Brownian motion is uniquely determined and the Laplacian is well defined. Research partially supported by NSERC (Canada), and EPSRC (UK). Research partially...

متن کامل

The Hausdorff Dimension of General Sierpinski Carpets

We refer to R as a general Sierpίήski carpet, after Mandelbrot [4], since Sierpiήski's universal curve is a special case of this construction [6]. It is clear that R = {J[fi(R)9 where r = \R\ and the ft are affine maps contracting R by a factor of n horizontally and m vertically. When n = m these maps are actually similarity transformations, and a well known argument shows the dimension of R is...

متن کامل

Random Walks on Graphical Sierpinski Carpets

We consider random walks on a class of graphs derived from Sierpinski carpets. We obtain upper and lower bounds (which are non-Gaussian) on the transition probabilities which are, up to constants, the best possible. We also extend some classical Sobolev and Poincar e inequalities to this setting.

متن کامل

From Sierpinski Carpets to Directed Graphs

Models of complex information processing based on artificial neural networks frequently apply fully connected or random graph structures. However, it is well known that biological neural systems operate on sparsely connected networks having properties quite distinct to random graphs. In this paper, a simple method is introduced for the deterministic generation of strongly connected digraphs. Th...

متن کامل

Coupling and Harnack Inequalities for Sierpinski Carpets

Uniform Harnack inequalities for harmonic functions on the preand graphical Sierpinski carpets are proved using a probabilistic coupling argument. Various results follow from this, including the construction of Brownian motion on Sierpinski carpets embedded in Md , d > 3, estimates on the fundamental solution of the heat equation, and Sobolev and Poincaré inequalities. The Sierpinski carpets (S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indiana University Mathematics Journal

سال: 2021

ISSN: ['1943-5258', '0022-2518', '1943-5266']

DOI: https://doi.org/10.1512/iumj.2021.70.8477