Search Results for ""

A similarity transformation which transforms each line to a parallel line whose length is a fixed multiple of the length of the original line. The simplest dilation is ...

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

Given any assignment of n-element sets to the n^2 locations of a square n×n array, is it always possible to find a partial Latin square? The fact that such a partial Latin ...

A.k.a. the pigeonhole principle. Given n boxes and m>n objects, at least one box must contain more than one object. This statement has important applications in number theory ...

A discrete group is a topological group with the discrete topology. Often in practice, discrete groups arise as discrete subgroups of continuous Lie groups acting on a ...

The disdyakis dodecahedron is the dual polyhedron of the Archimedean great rhombicuboctahedron A_3 and Wenninger dual W_(15). It is also called the hexakis octahedron ...

The disdyakis triacontahedron is the dual polyhedron of the Archimedean great rhombicosidodecahedron A_2. It is also known as the hexakis icosahedron (Holden 1971, p. 55). It ...

The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...

A module over a unit ring R is called divisible if, for all r in R which are not zero divisors, every element m of M can be "divided" by r, in the sense that there is an ...

The dominance relation on a set of points in Euclidean n-space is the intersection of the n coordinate-wise orderings. A point p dominates a point q provided that every ...