Search Results for ""

An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...

For a partial order, the size of the longest chain is called the length.

For a partial order, the size of the longest antichain is called the width.

Each subsequent row of Pascal's triangle is obtained by adding the two entries diagonally above. This follows immediately from the binomial coefficient identity (n; r) = ...

The Pasch configuration is the unbalanced (6_2,4_3) configuration (since there are two lines through each of six points and three points on each of four lines) illustrated ...

An m×n matrix which gives the possible outcome of a two-person zero-sum game when player A has m possible moves and player B n moves. The analysis of the matrix in order to ...

2^(50)=1024^5 bytes. Although the term petabyte is sometimes used to refer to 1024^5 bytes, such usage is deprecated in favor of the standard SI naming convention of 1 ...

A class of game in which players move alternately and each player is completely informed of previous moves. Finite, zero-sum, two-player games with perfect information ...

The term perfect square is used to refer to a square number, a perfect square dissection, or a factorable quadratic polynomial of the form a^2+/-2ab+b^2=(a+/-b)^2.

A characteristic of some systems making a transition to chaos. Doubling is followed by quadrupling, etc. An example of a map displaying period doubling is the logistic map.