Multicorns are not path connected

نویسندگان

  • John Hamal Hubbard
  • Dierk Schleicher
چکیده

The tricorn is the connectedness locus in the space of antiholomorphic quadratic polynomials z 7! z2 + c. We prove that the tricorn is not locally connected and not even pathwise connected, confirming an observation of John Milnor from 1992. We extend this discussion more generally for antiholomorphic unicritical polynomials of degrees d 2 and their connectedness loci, known as multicorns.

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

ثبت نام

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

منابع مشابه

Superior Multibrots for Multicorns for Positive Values

The Multibrots for Multicorns is a modification of the classic Mandelbrot and Julia sets and it is given by the complex function where and is a constant. The Multibrot fractal type is particularly interesting, with beautiful shapes and lots of spirals. In this paper we have presented different characteristics of Multibrot function for Multicorns using superior iterates. Further, different prope...

متن کامل

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

Connected but not path-connected subspaces of infinite graphs

Solving a problem of Diestel [8] we show that the Freudenthal compactification of a locally finite graph can have connected subsets that are not path-connected. However we prove that connectedness and pathconnectedness do coincide for all but a few sets, which have a complicated structure.

متن کامل

problem of Math 8302 , Manifolds and Topology II posted

According to the assignment, M may not be path-connected. Thus we decompose M into path-connected components. Since M is locally Euclidean, the path-connected components are the same as the connected components and are open subspaces of M . Thus each component itself is a smooth manifold. Then we will solve the problem on each of them separately but with the same method. This means we can assum...

متن کامل

Topology and Sobolev Spaces

with 1 ≤ p <∞. W (M,N) is equipped with the standard metric d(u, v) = ‖u− v‖W1,p . Our main concern is to determine whether or not W (M,N) is path-connected and if not what can be said about its path-connected components, i.e. its W -homotopy classes. We say that u and v are W -homotopic if there is a path u ∈ C([0, 1],W (M,N)) such that u = u and u = v. We denote by ∼p the corresponding equiva...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015