Search Results for ""

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

Roughly speaking, a tangent vector is an infinitesimal displacement at a specific point on a manifold. The set of tangent vectors at a point P forms a vector space called the ...

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 ...

Mills (1947) proved the existence of a real constant A such that |_A^(3^n)_| (1) is prime for all integers n>=1, where |_x_| is the floor function. Mills (1947) did not, ...

The smallest value of a set, function, etc. The minimum value of a set of elements A={a_i}_(i=1)^N is denoted minA or min_(i)a_i, and is equal to the first element of a ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

The modified bessel function of the second kind is the function K_n(x) which is one of the solutions to the modified Bessel differential equation. The modified Bessel ...

The term multigraph refers to a graph in which multiple edges between nodes are either permitted (Harary 1994, p. 10; Gross and Yellen 1999, p. 4) or required (Skiena 1990, ...

Let T_1 be the point at which the J_1-excircle meets the side A_2A_3 of a triangle DeltaA_1A_2A_3, and define T_2 and T_3 similarly. Then the lines A_1T_1, A_2T_2, and A_3T_3 ...

If equilateral triangles DeltaABE_(AB), DeltaBCE_(BC), and DeltaACE_(AC) are erected externally on the sides of any triangle DeltaABC, then their centers N_(AB), N_(BC), and ...