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

The upper and lower hinges are descriptive statistics of a set of N data values, where N is of the form N=4n+5 with n=0, 1, 2, .... The hinges are obtained by ordering the ...

Each row and each column in the group multiplication table lists each of the group elements once and only once. From this, it follows that no two elements may be in the ...

A formula of first-order logic is said to be in Skolemized form (sometimes also called Skolem standard form or universal form) if it is of the form forall x_1... forall x_nM, ...

An alternating group is a group of even permutations on a set of length n, denoted A_n or Alt(n) (Scott 1987, p. 267). Alternating groups are therefore permutation groups. ...

The Somos sequences are a set of related symmetrical recurrence relations which, surprisingly, always give integers. The Somos sequence of order k, or Somos-k sequence, is ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

The frame bundle on a Riemannian manifold M is a principal bundle. Over every point p in M, the Riemannian metric determines the set of orthonormal frames, i.e., the possible ...

A set of n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). The numbers ...

A monotonic matrix of order n is an n×n matrix in which every element is either 0 or contains a number from the set {1,...,n} subject to the conditions 1. The filled-in ...