Partition
A partition is a way of writing an Integer 
as a sum of Positive Integers without regardto order, possibly subject to one or more additional constraints. Particular types of partition functions include thePartition Function P, giving the number of partitions of a number without regardto order, and Partition Function Q, giving the number of ways of writing theInteger as a sum of Positive Integers without regard to order with the constraint thatall Integers in each sum are distinct.
References
Andrews, G. E. The Theory of Partitions. Cambridge, England: Cambridge University Press, 1998. Dickson, L. E. ``Partitions.'' Ch. 3 in History of the Theory of Numbers, Vol. 2: Diophantine Analysis. New York: Chelsea, pp. 101-164, 1952.
- Wiedersehen Manifold
- Wieferich Prime
- Wielandt's Theorem
- Wiener Filter
- Wiener Function
- Wiener-Khintchine Theorem
- Wiener Measure
- Wiener Space
- Wigner 3j-Symbol
- Wigner 6j-Symbol
- Wigner 9j-Symbol
- Wigner-Eckart Theorem
- Wilbraham-Gibbs Constant
- Wilcoxon Rank Sum Test
- Wilcoxon Signed Rank Test
- Wild Knot
- Wild Point
- Wilf-Zeilberger Pair
- Wilkie's Theorem
- Williams p+1 Factorization Method
- Wilson Plug
- Wilson Prime
- Wilson Quotient
- Douady's Rabbit Fractal
- Double Bubble