Search Results for ""

Every finite group of order n can be represented as a permutation group on n letters, as first proved by Cayley in 1878 (Rotman 1995).

The dimension of a partially ordered set P=(X,<=) is the size of the smallest realizer of P. Equivalently, it is the smallest integer d such that P is isomorphic to a ...

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

Let H be a heptagon with seven vertices given in cyclic order inscribed in a conic. Then the Pascal lines of the seven hexagons obtained by omitting each vertex of H in turn ...

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 wavelet used for filtering signals. Daubechies (1988, p. 980) has tabulated the numerical values up to order p=10.

A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.

The coloring red of two complete subgraphs of n/2 points (for even n) in order to generate a blue-empty graph.

An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...

The second-order ordinary differential equation (Moon and Spencer 1961, p. 157; Zwillinger 1997, p. 166).