Search Results for ""

Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...

A group that coincides with its commutator subgroup. If G is a non-Abelian group, its commutator subgroup is a normal subgroup other than the trivial group. It follows that ...

Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), or equivalently ...

A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...

If G is a weighted tree with weights w_i>1 assigned to each vertex v_i, then G is perfectly weighted if the matrix M_G=[w_1 0 ... 0; 0 w_2 ... 0; | ... ... |; 0 0 ... ...

A function f(x) is said to be periodic (or, when emphasizing the presence of a single period instead of multiple periods, singly periodic) with period p if f(x)=f(x+np) for ...

A graphical plot with abscissa given by the number p of consecutive numbers constituting a single period and ordinate given by the correlation ratio eta. The equation of the ...

The Perko pair is the pair of knots 10_(161) and 10_(162) illustrated above. For many years, they were listed as separate knots in Little (1885) and all similar tables, ...