Enumerative Combinatorics & Partitions

← Back to Domain-Specific Families

Abstractions about counting, arranging, and representing discrete structures. They include partitions and tableaux, Stirling and Motzkin-type numbers, derangements, combinatorial arrays and matrices, incidence and cluster algebras, discrepancy, polyhedral order, and combinatorial explosion.

24 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Addition principle — The counting rule that mutually exclusive alternatives have a total number of possibilities equal to the sum of their individual counts.
• Cluster algebra — A commutative algebra generated from overlapping algebraically independent clusters by iterated birational mutations governed by exchange matrices or quivers.
• Combinatorial explosion — The superpolynomial—often exponential or factorial—growth of candidate configurations as problem dimensions increase, making exhaustive representation or search rapidly infeasible.
• Combinatorial number system — A bijective representation of nonnegative integers as fixed-size combinations through sums of binomial coefficients, enabling direct ranking and unranking without listing earlier combinations.
• Costas array — A permutation array whose displacement vector between every pair of dots is unique.
• Derangement — A permutation with no fixed points, so every element moves away from its original position.
• Discrepancy theory — The study of how evenly discrete points, signs, or colors can approximate a desired continuous or balanced distribution over a family of test sets.
• Disjunct matrix — A binary nonadaptive group-testing design in which every column has a row containing 1 while any chosen set of at most d other columns all contain 0.
• Durfee square — The largest square contained in the Ferrers or Young diagram of an integer partition.
• Eulerian number — A permutation-counting number classified by an exact number of ascents or, under shifted conventions, descents.
• Higher spin alternating sign matrix — A square integer matrix whose row and column sums equal a fixed positive spin r and whose running partial sums along every row and column remain between zero and r.
• Hyperharmonic number — A recursively iterated family of partial sums beginning with reciprocals and extending the ordinary harmonic numbers by an order parameter.
• Incidence algebra — An algebra of interval-indexed functions on a locally finite partially ordered set, with multiplication given by convolution over intermediate elements.
• Lobb number — A two-parameter ballot number counting prefixes of balanced-parenthesis paths with a specified excess of open parentheses, generalizing Catalan numbers.
• Motzkin number — A sequence whose nth term counts noncrossing chord matchings on n labeled points in convex position, allowing unmatched points.
• Order polytope — The convex polytope of order-preserving maps from a finite poset into the unit interval.
• Piecewise syndetic set — A subset of the natural numbers whose gaps are uniformly bounded on arbitrarily long intervals.
• Quasisymmetric function — A bounded-degree formal power series whose coefficient depends on an exponent composition but not on the particular increasing sequence of variable indices.
• Rank of a partition — Associate an integer partition with Dyson's rank—largest part minus number of parts—while distinguishing the separate Durfee-square rank convention used elsewhere in combinatorics.
• Representation theory of the symmetric group — The classification and analysis of symmetric-group actions on vector spaces through partitions, Young diagrams, tableaux, characters and Specht modules.
• Robinson–Schensted–Knuth correspondence — A weight-preserving bijection between nonnegative-integer matrices and pairs of semistandard Young tableaux of equal shape.
• Schröder number — A sequence counting diagonal-bounded lattice paths with horizontal, vertical and diagonal steps, equivalently several recursively decomposable combinatorial structures.
• Stirling numbers of the second kind — The numbers S(n,k) counting partitions of an n-element labeled set into exactly k nonempty unlabeled blocks.
• Stirling transform — The invertible sequence transform that weights source terms by Stirling numbers of the second kind, with inverse coefficients given by signed first-kind Stirling numbers.