Search Results for ""

Let K be an algebraically closed field and let I be an ideal in K(x), where x=(x_1,x_2,...,x_n) is a finite set of indeterminates. Let p in K(x) be such that for any ...

The underlying set of the fundamental group of X is the set of based homotopy classes from the circle to X, denoted [S^1,X]. For general spaces X and Y, there is no natural ...

Let A={A_1,A_2,...,A_n} be a union-closed set, then the union-closed set conjecture states that an element exists which belongs to at least n/2 of the sets in A. Sarvate and ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

For a set partition of n elements, the n-character string a_1a_2...a_n in which each character gives the set block (B_0, B_1, ...) in which the corresponding element belongs ...

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...

One of the Zermelo-Fraenkel axioms, also known as the axiom of regularity (Rubin 1967, Suppes 1972). In the formal language of set theory, it states that x!=emptyset=> exists ...

The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...