Search Results for ""

A disk algebra is an algebra of functions which are analytic on the open unit disk in C and continuous up to the boundary. A representative measure for a point x in the ...

The unit lower half-disk is the portion of the complex plane satisfying {|z|<=1,I[z]<0}.

The unit upper half-disk is the portion of the complex plane satisfying {|z|<=1,I[z]>0}.

Pick three points P=(x_1,y_1), Q=(x_2,y_2), and R=(x_3,y_3) distributed independently and uniformly in a unit disk K (i.e., in the interior of the unit circle). Then the ...

Solving the wave equation on a disk gives a solution in terms of Bessel functions.

Using disk point picking, x = sqrt(r)costheta (1) y = sqrt(r)sintheta (2) for r in [0,1], theta in [0,2pi), choose two points at random in a unit disk and find the ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

The disk model is the standard Boolean-Poisson model in two-dimensional continuum percolation theory. In particular, the disk model is characterized by the existence of a ...

The problem of finding the connection between a continuous function f on the boundary partialR of a region R with a harmonic function taking on the value f on partialR. In ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...