Search Results for ""

If a is an element of a field F over the prime field P, then the set of all rational functions of a with coefficients in P is a field derived from P by adjunction of a.

There are essentially three types of Fisher-Tippett extreme value distributions. The most common is the type I distribution, which are sometimes referred to as Gumbel types ...

A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...

For a permutation alpha in the symmetric group S_p, the alpha-permutation graph of a labeled graph G is the graph union of two disjoint copies of G (say, G_1 and G_2), ...

A set considered together with the sigma-algebra on the set.

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

A leaf of an unrooted tree is a node of vertex degree 1. Note that for a rooted or planted tree, the root vertex is generally not considered a leaf node, whereas all other ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

The Gauss-Bonnet formula has several formulations. The simplest one expresses the total Gaussian curvature of an embedded triangle in terms of the total geodesic curvature of ...