Search Results for ""

A set S together with a relation >= which is both transitive and reflexive such that for any two elements a,b in S, there exists another element c in S with c>=a and c>=b. In ...

An ambiguous term which is sometimes used to mean a partially ordered set and sometimes to mean a totally ordered set.

A set T of integers is said to be recursively enumerable if it constitutes the range of a recursive function, i.e., if there exists a recursive function that can eventually ...

The term Mandelbrot set is used to refer both to a general class of fractal sets and to a particular instance of such a set. In general, a Mandelbrot set marks the set of ...

Given a distance-regular graph G with integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G at distance i=d(x,y), there are exactly c_i neighbors of y in ...

The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...

For a set S, the span is defined by maxS-minS, where max is the maximum and min is the minimum.

The set containing no elements, commonly denoted emptyset or emptyset, the former of which is used in this work. These correspond to Wolfram Language and TeX characters ...

Set theory is the mathematical theory of sets. Set theory is closely associated with the branch of mathematics known as logic. There are a number of different versions of set ...

A set S of positive integers is said to be Diophantine iff there exists a polynomial Q with integral coefficients in m>=1 indeterminates such that ...