Search Results for ""

A topological space fulfilling the T0-separation axiom: For any two points x,y in X, there is an open set U such that x in U and y not in U or y in U and x not in U. ...

A function f is said to have a upper bound C if f(x)<=C for all x in its domain. The least upper bound is called the supremum. A set is said to be bounded from above if it ...

Let (K,|·|) be a valuated field. The valuation group G is defined to be the set G={|x|:x in K,x!=0}, with the group operation being multiplication. It is a subgroup of the ...

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.

Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

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 ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

The centralizer of an element z of a group G is the set of elements of G which commute with z, C_G(z)={x in G,xz=zx}. Likewise, the centralizer of a subgroup H of a group G ...

The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...