Search Results for ""

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.

The branch of mathematics which formalizes a number of algebraic properties of collections of transformations between mathematical objects (such as binary relations, groups, ...

In mathematics, the term "collection" is generally used to mean a multiset, i.e., a set in which order is ignored but multiplicity is significant.

A method of determining coefficients alpha_l in an expansion y(x)=y_0(x)+sum_(l=1)^qalpha_ly_l(x) so as to nullify the values of an ordinary differential equation L[y(x)]=0 ...

The five of Hilbert's axioms which concern geometric equivalence.

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...

A number puzzle in which a group of arithmetical operations has some or all of its digits replaced by letters or symbols, and where the original digits must be found. In such ...

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...