Search Results for ""

The number of nondecreasing lists {a_1,a_2,...,a_n} consisting of n elements 1<=a_i<=k is given by the binomial coefficient N(n,k)=(n+k-1; n-1). For example, there are six ...

A pair of quantities (a, b) where ordering is significant, so (a, b) is considered distinct from (b, a) for a!=b.

A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.

The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...

An orthogonal array OA(k,s) is a k×s^2 array with entries taken from an s-set S having the property that in any two rows, each ordered pair of symbols from S occurs exactly ...

In any tree, the number of dissimilar points minus the number of dissimilar lines plus the number of symmetry lines equals 1.

The number of outward directed graph edges from a given graph vertex in a directed graph.

The two-dimensional version of the ham sandwich theorem.

The Pappus configuration is the 9_3 configuration illustrated above that appears in Pappus's hexagon theorem. It is one of the three 9_3 configurations. The Levi graph of the ...

A set of blocks, also called a resolution class, that partition the set V, where (V,B) is a balanced incomplete block design.