SearcharxivSearch

arXiv subjects

Jörn Peter

Publications and source records attributed to Jörn Peter.

3 recordsLinked to original sources

Escape rate and Hausdorff measure for entire functions

The escaping set of an entire function is the set of points that tend to infinity under iteration. We consider subsets of the escaping set defined in terms of escape rates and obtain upper and lower bounds for the Hausdorff measure of these sets with respect to certain gauge functions.

math.DS

Hausdorff measure of escaping and Julia sets for bounded type functions of finite order

We show that the escaping sets and the Julia sets of bounded type transcendental entire functions of order $ρ$ become 'smaller' as $ρ\to\infty$. More precisely, their Hausdorff measures are infinite with respect to the gauge function $h_γ(t)=t^2g(1/t)^γ$, where $g$ is the inverse of a linearizer of some exponential map and $γ\geq(\logρ(f)+K_1)/c$, but for $ρ$ large enough, there exists a function $f_ρ$ of bounded type with order $ρ$ such that the Hausdorff measures of the escaping set and the Julia set of $f_ρ$ with respect to $h_{γ'}$ are zero whenever $γ'\leq(\logρ-K_2)/c$.

math.DS

Poincaré functions with spiders' webs

For a polynomial p with a repelling fixed point w, we consider Poincaré functions of p at w, i.e. entire functions L which satisfy L(0)=w and p(L(z))=L(p'(w)*z) for all z in the complex plane. We show that if the component of the Julia set of p that contains w equals {w}, then the (fast) escaping set of L is a spider's web; in particular it is connected. More precisely, we classify all linearizers of polynomials with regards to the spider's web structure of the set of all points which escape faster than the iterates of the maximum modulus function at a sufficiently large point.

math.DS