Search Results for ""

A function used to study ordinary differential equations.

A function f which may (but does not necessarily) associate a given member of the range of f with more than one member of the domain of f. For example, trigonometric ...

The sequence generated by repeated application of a map. The map is said to have a closed orbit if it has a finite number of elements.

An algorithm which constructs allowed mathematical statements from simple ingredients.

If a group of men and women may date only if they have previously been introduced, then a complete set of dates is possible iff every subset of men has collectively been ...

A sequence of random variates X_0, X_1, ... with finite means such that the conditional expectation of X_(n+1) given X_0, X_1, X_2, ..., X_n is equal to X_n, i.e., ...

A pair of matrices ND^(-1) or D^(-1)N, where N is the matrix numerator and D is the denominator.

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...

Numerical maximization is implemented as NMaximize[f, vars]5.0.

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...