Search Results for ""

Let F be the set of complex analytic functions f defined on an open region containing the set closure of the unit disk D={z:|z|<1} satisfying f(0)=0 and df/dz(0)=1. For each ...

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...

Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

Given any open set U in R^n with compact closure K=U^_, there exist smooth functions which are identically one on U and vanish arbitrarily close to U. One way to express this ...

A set of orthogonal functions {phi_n(x)} is termed complete in the closed interval x in [a,b] if, for every piecewise continuous function f(x) in the interval, the minimum ...

Let E be a simply connected compact set in the complex plane. By the Riemann mapping theorem, there is a unique analytic function ...

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

A cubic spline is a spline constructed of piecewise third-order polynomials which pass through a set of m control points. The second derivative of each polynomial is commonly ...

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...