Search Results for ""

7 7 6 6 3 1; 6 5 4 2 ; 3 3 ; 2 A descending plane partition of order n is a two-dimensional array (possibly empty) of positive integers less than or equal to n such that the ...

A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...

A set S is said to be GCD-closed if GCD(x_i,x_j) in S for 1<=i,j<=n.

An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

Let X be a set and S a collection of subsets of X. A subset A subset X is shattered by S if each subset B subset A of A can be expressed as the intersection of A with a ...

A set A of integers is productive if there exists a partial recursive function f such that, for any x, the following holds: If the domain of phi_x is a subset of A, then f(x) ...

The expected number of trials needed to collect a complete set of n different objects when picked at random with repetition is nH_n (Havil 2003, p. 131). For n=1, 2, ..., the ...

The version of set theory obtained if Axiom 6 of Zermelo-Fraenkel set theory is replaced by 6'. Selection axiom (or "axiom of subsets"): for any set-theoretic formula A(u), ...

The rectifiable sets include the image of any Lipschitz function f from planar domains into R^3. The full set is obtained by allowing arbitrary measurable subsets of ...