Search Results for ""

A function composed of a set of equally spaced jumps of equal length, such as the ceiling function f(x)=[x], floor function f(x)=|_x_|, or nearest integer function f(x)=[x].

Let P(L) be the set of all prime ideals of L, and define r(a)={P|a not in P}. Then the Stone space of L is the topological space defined on P(L) by postulating that the sets ...

A condition used in the definition of a mathematical object, commonly denoted : or |. For example, the rationals Q can be defined by Q={p/q:q!=0,p,q in Z}, read as "the set ...

A syllogism, also known as a rule of inference, is a formal logical scheme used to draw a conclusion from a set of premises. An example of a syllogism is modus ponens.

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