Search Results for ""

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

Let P be the set of prime ideals of a commutative ring A. Then an affine scheme is a technical mathematical object defined as the ring spectrum sigma(A) of P, regarded as a ...

A square matrix A is antihermitian if it satisfies A^(H)=-A, (1) where A^(H) is the adjoint. For example, the matrix [i 1+i 2i; -1+i 5i 3; 2i -3 0] (2) is an antihermitian ...

An aperiodic tiling is a non-periodic tiling in which arbitrarily large periodic patches do not occur. A set of tiles is said to be aperiodic if they can form only ...

The associahedron is the n-dimensional generalization of the pentagon. It was discovered by Stasheff in 1963 and it is also known as the Stasheff polytope. The number of ...

The attractor of the iterated function system given by the set of "fern functions" f_1(x,y) = [0.85 0.04; -0.04 0.85][x; y]+[0.00; 1.60] (1) f_2(x,y) = [-0.15 0.28; 0.26 ...

The base manifold in a bundle is analogous to the domain for a set of functions. In fact, a bundle, by definition, comes with a map to the base manifold, often called pi or ...

A set of curvilinear coordinates defined by x = (asinhv)/(coshv-cosu) (1) y = (asinu)/(coshv-cosu) (2) z = z, (3) where u in [0,2pi), v in (-infty,infty), and z in ...

Let S_n be the set of permutations of {1, 2, ..., n}, and let sigma_t be the continuous time random walk on S_n that results when randomly chosen transpositions are performed ...