Search Results for ""

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

A set of class representatives is a subset of X which contains exactly one element from each equivalence class.

A relational system is a structure R=(S,{P_i:i in I},{f_j:j in J}) consisting of a set S, a collection of relations P_i(i in I) on S, and a collection of functions f_j(j in ...

An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...

A monomial is a product of positive integer powers of a fixed set of variables (possibly) together with a coefficient, e.g., x, 3xy^2, or -2x^2y^3z. A monomial can also be ...

A grammar defining formal language L is a quadruple (N,T,R,S), where N is a finite set of nonterminals, T is a finite set of terminal symbols, R is a finite set of ...

The largest n such that |z_n|<4 in a Mandelbrot set. Points of different count are often assigned different colors.

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...