Search Results for ""

A method for constructing magic squares of odd order, also called the Siamese method.

If W is a simply connected, compact manifold with a boundary that has two components, M_1 and M_2, such that inclusion of each is a homotopy equivalence, then W is ...

A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z], is said to be k-balanced if sum_(i=1)^qbeta_i=k+sum_(i=1)^palpha_i.

A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).

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

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

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.

A group is called k-transitive group if there exists a set of elements on which the group acts faithfully and k-transitively. It should be noted that transitivity computed ...

An n-dimensional vector, i.e., a vector (x_1, x_2, ..., x_n) with n components. In dimensions n greater than or equal to two, vectors are sometimes considered synonymous with ...

A p-elementary subgroup of a finite group G is a subgroup H which is the group direct product H=C_n×P, where P is a p-group, C_n is a cyclic group, and p does not divide n.