Linked from

The 20 pages that link to Integer partition, each with the reason it gives.

• Generating functionRelated: Partition generating functions encode restrictions such as allowed part sizes and multiplicities.

• Integer factorizationCompared with: Partitions use addition rather than multiplication and do not require prime components.

• Partition functionNarrower topic: Each value p(n) counts the integer partitions of n.

• Lagrange's four-square theoremRelated: A four-square representation is a constrained additive decomposition with square summands.

• Stirling numbers of the second kindCompared with: Unlike set partitions, it records block sizes rather than which elements belong to each block.

• Partition of a setCompared with: It partitions an integer's value, not the elements of a set.

• Stars and barsCompared with: Unlike stars and bars, partitions do not distinguish groups by position.

• Integer sequenceRelated: Counting partitions by size produces a central integer sequence.

• Gaussian binomial coefficientRelated: Gaussian coefficients also generate partition identities and count partitions under bounds.

• Jacobi triple productRelated: Generating functions derived from the identity encode restricted integer partitions.

• Pólya enumeration theoremRelated: Cycle types are partitions of the number of positions being permuted.

• Rogers–Ramanujan identitiesNarrower topic: The identities’ series coefficients count partitions subject to restrictions on successive parts.

• Young tableauNarrower topic: Its parts specify the row lengths of a tableau’s diagram.

• Fermat polygonal number theoremRelated: The theorem guarantees a partition whose parts are n-gonal numbers, with at most n terms.

• Muirhead's inequalityRelated: Sorted exponent vectors in Muirhead comparisons are partitions of the same degree.

• Pentagonal number theoremNarrower topic: The theorem’s principal combinatorial consequences concern counts of integer partitions.

• Zeckendorf's theoremRelated: Zeckendorf representations are partitions with Fibonacci summands and two extra restrictions.

• Ono's inequalityNarrower topic: Partitions are the objects counted by the function constrained in Ono's inequality.

• Rogers–Ramanujan continued fractionRelated: The associated Rogers–Ramanujan series count partitions subject to difference restrictions.

• Twelvefold wayRelated: Occupancy counts of indistinguishable boxes lead to integer partitions when the box count varies.