Search Results for ""

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

The Dehn invariant is a constant defined using the angles and edge lengths of a three-dimensional polyhedron. It is significant because it remains constant under polyhedron ...

Let s_1, s_2, ... be an infinite series of real numbers lying between 0 and 1. Then corresponding to any arbitrarily large K, there exists a positive integer n and two ...

The distribution function D(x), also called the cumulative distribution function (CDF) or cumulative frequency function, describes the probability that a variate X takes on a ...

An equilateral zonohedron is a zonohedron in which the line segments of the star on which it is based are of equal length (Coxeter 1973, p. 29). Plate II (following p. 32 of ...

Ergodic theory can be described as the statistical and qualitative behavior of measurable group and semigroup actions on measure spaces. The group is most commonly N, R, R-+, ...

The dimension e(G), also called the Euclidean dimension (e.g., Buckley and Harary 1988) of a graph, is the smallest dimension n of Euclidean n-space in which G can be ...

Although Descartes originally used the term "imaginary number" to refer to what is today known as a complex number, in standard usage today, "imaginary number" means a ...

The Knuth-Bendix completion algorithm attempts to transform a finite set of identities into a finitely terminating, confluent term rewriting system whose reductions preserve ...

The largest value of a set, function, etc. The maximum value of a set of elements A={a_i}_(i=1)^N is denoted maxA or max_(i)a_i, and is equal to the last element of a sorted ...