Search Results for ""

A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way. The graphs ...

A set of ascending sequences in a permutation is called a run (Graham et al. 1994) or sometimes a rise (Comtet 1974, p. 241). A sorted permutation consists of a single run, ...

The phrase dependent percolation is used in two-dimensional discrete percolation to describe any general model in which the states of the various graph edges (in the case of ...

Augmentation is the dual operation of truncation which replaces the faces of a polyhedron with pyramids of height h (where h may be positive, zero, or negative) having the ...

There are several closely related results that are variously known as the binomial theorem depending on the source. Even more confusingly a number of these (and other) ...

The confluent hypergeometric function of the first kind _1F_1(a;b;z) is a degenerate form of the hypergeometric function _2F_1(a,b;c;z) which arises as a solution the ...

The term metric signature refers to the signature of a metric tensor g=g_(ij) on a smooth manifold M, a tool which quantifies the numbers of positive, zero, and negative ...

Stellation is the process of constructing polyhedra by extending the facial planes past the polyhedron edges of a given polyhedron until they intersect (Wenninger 1989). The ...

The kurtosis excess of a distribution is sometimes called the excess, or excess coefficient. In graph theory, excess refers to the quantity e=n-n_l(v,g) (1) for a v-regular ...

The nth root of the denominator B_n of the nth convergent A_n/B_n of a number x tends to a constant lim_(n->infty)B_n^(1/n) = e^beta (1) = e^(pi^2/(12ln2)) (2) = 3.275823... ...