Search Results for ""

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

An Abelian planar difference set of order n exists only for n a prime power. Gordon (1994) has verified it to be true for n<2000000.

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

The vector space generated by the columns of a matrix viewed as vectors. The column space of an n×m matrix A with real entries is a subspace generated by m elements of R^n, ...

There are at least two distinct (though related) notions of the term Hilbert algebra in functional analysis. In some literature, a linear manifold A of a (not necessarily ...