Search Results for ""

A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

A well ordered set of monomials which also satisfies the condition "u<v implies uw<vw" for all monomials u, v, and w. Examples of monomial orders are the lexicographic order ...

Let G be group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

The rectifiable sets include the image of any Lipschitz function f from planar domains into R^3. The full set is obtained by allowing arbitrary measurable subsets of ...

A totally imaginary field is a field with no real embeddings. A general number field K of degree n has s real embeddings (0<=s<=n) and 2t imaginary embeddings (0<=t<=n/2), ...

Let G be a group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...

A pair of quantities (a, b) where ordering is significant, so (a, b) is considered distinct from (b, a) for a!=b.

Set theory is the mathematical theory of sets. Set theory is closely associated with the branch of mathematics known as logic. There are a number of different versions of set ...