Search Results for ""

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 ...

Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...

A plane partition is a two-dimensional array of integers n_(i,j) that are nonincreasing both from left to right and top to bottom and that add up to a given number n. In ...

A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...

There are a number of functions in mathematics denoted with upper or lower case Qs. 1. The nome q. 2. A prefix denoting q-analogs and q-series. 3. Q_n or q_n with n=0, 1, 2, ...

A set partition of a set S is a collection of disjoint subsets of S whose union is S. The number of partitions of the set {k}_(k=1)^n is called a Bell number.

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 ...

Given a smooth manifold M with an open cover U_i, a partition of unity subject to the cover U_i is a collection of smooth, nonnegative functions psi_i, such that the support ...