Search Results for ""

Lachlan's term for a set of four lines, no three of which are concurrent.

Lachlan's term for a set of four points, no three of which are collinear.

A relation R on a set S is irreflexive provided that no element is related to itself; in other words, xRx for no x in S.

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess finite monotonicity provided that, whenever a set E in S is covered by a ...

A set which transforms via converse functions. Antisets usually arise in the context of Chu spaces.

A function f mapping a set X->X/R (X modulo R), where R is an equivalence relation in X, is called a canonical map.

Each point in the convex hull of a set S in R^n is in the convex combination of n+1 or fewer points of S.

A set X is a called a "convex cone" if for any x,y in X and any scalars a>=0 and b>=0, ax+by in X.

Suppose <= is a partial ordering on a nonempty set A. Then the elements a,b in A are said to be comparable provided a<=b or b<=a. Because two elements in a partially ordered ...