Non-landing hairs in Sierpinski curve Julia sets of transcendental entire maps

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Some definitions have been introduced and clarifications have been made in several proofs. Substantial changes in Proposition

Scientific paper

We consider the family of transcendental entire maps given by $f_a(z)=a(z-(1-a))\exp(z+a)$ where $a$ is a complex parameter. Every map has a superattracting fixed point at $z=-a$ and an asymptotic value at $z=0$. For $a>1$ the Julia set of $f_a$ is known to be homeomorphic to the Sierpi\'nski universal curve, thus containing embedded copies of any one-dimensional plane continuum. In this paper we study subcontinua of the Julia set that can be defined in a combinatorial manner. In particular, we show the existence of non-landing hairs with prescribed combinatorics embedded in the Julia set for all parameters $a\geq 3$. We also study the relation between non-landing hairs and the immediate basin of attraction of $z=-a$. Even as each non-landing hair accumulates onto the boundary of the immediate basin at a single point, its closure, nonetheless, becomes an indecomposable subcontinuum of the Julia set.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Non-landing hairs in Sierpinski curve Julia sets of transcendental entire maps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Non-landing hairs in Sierpinski curve Julia sets of transcendental entire maps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-landing hairs in Sierpinski curve Julia sets of transcendental entire maps will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-465154

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.