Search Results for ""

The order n of an algebraic surface is the order of the polynomial defining a surface, which can be geometrically interpreted as the maximum number of points in which a line ...

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...

For a partial order, the size of the longest antichain is called the width.

Given a sample of n variates X_1, ..., X_N, reorder them so that Y_1<Y_2<...<Y_N. Then Y_i is called the ith order statistic (Hogg and Craig 1970, p. 146), sometimes also ...

For a partial order, the size of the longest chain is called the length.

The set of terms of first-order logic (also known as first-order predicate calculus) is defined by the following rules: 1. A variable is a term. 2. If f is an n-place ...

Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...

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

An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...