The Young lattice is a partially ordered set whose elements are integer partitions, including the empty partition. Each partition of an integer is identified with its diagram, and the order is inclusion of Young diagrams. A cover adds exactly one box. A saturated path from the empty diagram to is equivalent to a standard Young tableau of shape .
Young's lattice is a combinatorial structure used in the representation theory of symmetric groups and, more broadly, in the study of symmetric functions and partition theory. It is formed by considering all partitions of a given integer and organizing them in a specific way. In particular, a Young diagram represents a partition, where a partition of a positive integer \( n \) is a way of writing \( n \) as a sum of positive integers, where the order of addends does not matter.
New to topics? Read the docs here!