Search Results for ""

If (f,U) and (g,V) are functions elements, then (g,V) is a direct analytic continuation of (f,U) if U intersection V!=emptyset and f and g are equal on U intersection V.

A function element is an ordered pair (f,U) where U is a disk D(Z_0,r) and f is an analytic function defined on U. If W is an open set, then a function element in W is a pair ...

The contour C_epsilon illustrated above.

The problem of determining the vertices of a Schwarz-Christoffel mapping (Krantz 1999, p. 176).

The number of poles of an automorphic function in the closure of its fundamental region.

A circle packing is an arrangement of circles inside a given boundary such that no two overlap and some (or all) of them are mutually tangent. The generalization to spheres ...

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...

A fractal process for which H<1/2, so r<0.

The largest n such that |z_n|<4 in a Mandelbrot set. Points of different count are often assigned different colors.