Search Results for ""

A random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...

A random partition of a number n is one of the P(n) possible partitions of n, where P(n) is the partition function P. A random partition can be given by RandomPartition[n] in ...

A Young tableau chosen at random from those having a given shape. A random tableau can be generated by RandomTableau[shape] in the Wolfram Language package Combinatorica` . ...

The space of currents arising from rectifiable sets by integrating a differential form is called the space of two-dimensional rectifiable currents. For C a closed bounded ...

A type of error-correcting code that is related to Hadamard matrices.

In a complete metric space, a countable union of nowhere dense sets is said to be meager; the complement of such a set is a residual set.

sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).

If the matrices A, X, B, and C satisfy AX-XB=C, then [I X; 0 I][A C; 0 B][I -X; 0 I]=[A 0; 0 B], where I is the identity matrix.

Deciding whether a given Boolean formula in conjunctive normal form has an assignment that makes the formula "true." In 1971, Cook showed that the problem is NP-complete.

A diagonal matrix whose diagonal elements all contain the same scalar lambda. A scalar matrix is therefore equivalent to lambdaI, where I is the identity matrix.