Search Results for ""

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

A method for constructing magic squares of odd order, also called de la Loubere's method.

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

The order n T-polyomino consists of a vertical line of n-3 squares capped by a horizontal line of three squares centered on the line.

Young's lattice Y_p is the partial order of partitions contained within a partition p ordered by containment (Stanton and White 1986; Skiena 1990, p. 77).

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

Given n sets of variates denoted {X_1}, ..., {X_n} , the first-order covariance matrix is defined by V_(ij)=cov(x_i,x_j)=<(x_i-mu_i)(x_j-mu_j)>, where mu_i is the mean. ...

A subgroup is a subset H of group elements of a group G that satisfies the four group requirements. It must therefore contain the identity element. "H is a subgroup of G" is ...

The center of any sphere which has a contact of (at least) first-order with a curve C at a point P lies in the normal plane to C at P. The center of any sphere which has a ...

If we expand the determinant of a matrix A using determinant expansion by minors, first in terms of the minors of order r formed from any r rows, with their complementaries, ...