Results 1 
6 of
6
Random Mapping Statistics
 IN ADVANCES IN CRYPTOLOGY
, 1990
"... Random mappings from a finite set into itself are either a heuristic or an exact model for a variety of applications in random number generation, computational number theory, cryptography, and the analysis of algorithms at large. This paper introduces a general framework in which the analysis of ..."
Abstract

Cited by 78 (6 self)
 Add to MetaCart
Random mappings from a finite set into itself are either a heuristic or an exact model for a variety of applications in random number generation, computational number theory, cryptography, and the analysis of algorithms at large. This paper introduces a general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out: These parameters are studied systematically through the use of generating functions and singularity analysis. In particular, an open problem of Knuth is solved, namely that of finding the expected diameter of a random mapping. The same approach is applicable to a larger class of discrete combinatorial models and possibilities of automated analysis using symbolic manipulation systems ("computer algebra") are also briefly discussed.
Classification of escaping exponential maps
"... Abstract. We give a complete classification of the set of parameters κ for which the singular value of Eκ: z ↦ → exp(z) + κ escapes to ∞ under iteration. In particular, we show that every pathconnected component of this set is a curve to infinity. 1. ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Abstract. We give a complete classification of the set of parameters κ for which the singular value of Eκ: z ↦ → exp(z) + κ escapes to ∞ under iteration. In particular, we show that every pathconnected component of this set is a curve to infinity. 1.
On the Convergence of Hyperbolic Components in Families of Finite Type
 MATHEMATICA GOTTINGIENSIS
, 1995
"... We study approximations of analytic families G(; \Delta) of entire functions by analytic families F n (; \Delta), for example polynomials, where 2 C . In order to control the dynamics of these functions the families are assumed to be of constant finite type. In this setting we prove the convergenc ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We study approximations of analytic families G(; \Delta) of entire functions by analytic families F n (; \Delta), for example polynomials, where 2 C . In order to control the dynamics of these functions the families are assumed to be of constant finite type. In this setting we prove the convergence of the hyperbolic components as kernels in the sense of Carath'eodory, which is a stronger notion than the usual pointwise convergence. We give an example that in general the hyperbolic components do not converge in the Hausdorff metric as the Julia sets do.
Entire functions of slow growth whose Julia set coincides with the plane
, 2000
"... We construct a transcendental entire function f with J(f) =C such that f has arbitrarily slow growth; that is, log f(z)  ≤φ(z)logz for z >r0,whereφis an arbitrary prescribed function tending to infinity. For an entire function f we denote the Julia set by J(f). By definition, it is the compl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We construct a transcendental entire function f with J(f) =C such that f has arbitrarily slow growth; that is, log f(z)  ≤φ(z)logz for z >r0,whereφis an arbitrary prescribed function tending to infinity. For an entire function f we denote the Julia set by J(f). By definition, it is the complement of the maximal open set F(f), the set of normality, where the iterates f n form a normal family. While for polynomials the Julia set always has empty interior, for transcendental functions it may coincide with the whole complex plane C. The first example with this property was given by Baker [1] and later Misiurewicz [16] showed that this is the case for the exponential function. There are several methods of constructing such examples (besides [1] and [16] we refer to
Growth in Complex Exponential Dynamics
 Ed.), University of West Bohemia Press, Plzen, Czech republic
, 1998
"... Both the computer drawing of the complement of the Mandelbrotlike set of a oneparameter dependent complex exponential family of maps and the computer drawing of the Julia sets of the maps of this family, grow with the maximal number of iterations we choose. Some graphic examples of this growth, ..."
Abstract
 Add to MetaCart
Both the computer drawing of the complement of the Mandelbrotlike set of a oneparameter dependent complex exponential family of maps and the computer drawing of the Julia sets of the maps of this family, grow with the maximal number of iterations we choose. Some graphic examples of this growth, which evoke the image of a garden, are shown here. 1. INTRODUCTION During the period 191820 the field of complex analytic dynamics showed a vigorous growth when Julia [1] and Fatou [2] became interested in the behavior of complex functions under iteration. Sometimes the results of iteration were quite tame or stable; at other times these iterations behaved in a dramatically different fashion what we now call chaotic behavior (see a historical overview of complex dynamics in [3]). In 1980, Mandelbrot [4] used computer graphics to explore complex dynamics. His discovery of the Mandelbrot set [4, 5] prompted many mathematicians as Douady and Hubbard [6], Peitgen and Richter [7], Branner...