Search Results for ""

Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...

A maximal ideal of a ring R is an ideal I, not equal to R, such that there are no ideals "in between" I and R. In other words, if J is an ideal which contains I as a subset, ...

A meromorphic function is a single-valued function that is analytic in all but possibly a discrete subset of its domain, and at those singularities it must go to infinity ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...

Given a set S of n nonnegative integers, the number partitioning problem requires the division of S into two subsets such that the sums of number in each subset are as close ...

A subset {v_1,...,v_k} of a vector space V, with the inner product <,>, is called orthogonal if <v_i,v_j>=0 when i!=j. That is, the vectors are mutually perpendicular. Note ...

Let f:A->B be a map between sets A and B. Let Y subset= B. Then the preimage of Y under f is denoted by f^(-1)(Y), and is the set of all elements of A that map to elements in ...

If f:D->Y is a map (a.k.a. function, transformation, etc.) over a domain D, then the range of f, also called the image of D under f, is defined as the set of all values that ...

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...