Search Results for ""

A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...

The reflexive closure of a binary relation R on a set X is the minimal reflexive relation R^' on X that contains R. Thus aR^'a for every element a of X and aR^'b for distinct ...

The reflexive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same reflexive closure as R. Thus aR^'b for any elements a and b of X, ...

The maximum cardinal number of a collection of subsets of a t-element set T, none of which contains another, is the binomial coefficient (t; |_t/2_|), where |_x_| is the ...

A function has compact support if it is zero outside of a compact set. Alternatively, one can say that a function has compact support if its support is a compact set. For ...

A topology is given by a collection of subsets of a topological space X. The smallest topology has two open sets, the empty set emptyset and X. The largest topology contains ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

The algebraics, sometimes denoted A (Derbyshire 2004, p. 173), are the set of algebraic numbers. The set of algebraic numbers is implemented in the Wolfram Language as ...

The first corona of a tile is the set of all tiles that have a common boundary point with that tile (including the original tile itself). The second corona is the set of ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...