Hooksets of Young Diagrams

• Hooksets of Young Diagrams are collections of hook lengths from a partition’s Young diagram that capture deep combinatorial and algebraic properties.
• The framework employs Frobenius coordinates to encode partitions, enabling explicit structural theorems and enumeration results for core partitions and symmetric functions.
• This approach connects partition theory with numerical semigroups, integrable systems, and operator theory, providing actionable insights for combinatorial and algebraic research.

A Young diagram is a graphical realization of a partition of a nonnegative integer, and the "hookset" of a Young diagram is the collection of all hook lengths realized by its constituent boxes. The study of hooksets draws together classical partition theory, the rich algebraic structure of numerical semigroups, and modern developments in the theory of symmetric functions, integrable systems, and representations. The hookset not only encodes deep combinatorial properties of the partition but also provides a fundamental coordinate system ("hook variables" or Frobenius coordinates) that governs the algebraic manipulation of Schur functions, cut-and-join operators, and $\tau$-functions. Recent research has established precise correspondences between partitions with prescribed hooksets and algebraic objects such as numerical monoids, developed explicit structural theorems, and extended enumeration results for special classes such as simultaneous $s/t$-cores and complete hooksets (Keith et al., 2010, Mironov et al., 2019).

1. Definitions: Partitions, Young Diagrams, Hooks, and Hooksets

A partition $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$ of a nonnegative integer $n$ is a finite nonincreasing sequence with $\sum_{i=1}^k \lambda_i = n$ and $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$. Its Young diagram is formed by placing $\lambda_j$ boxes in the $j$-th row (using the fourth-quadrant convention), with the cell at $(i, j)$ present if $\lambda_j \geq i$.

The hook at a cell $s/t$0 is $s/t$1. The hookset of $s/t$2 is $s/t$3; it consists of all hook lengths realized in the diagram (Keith et al., 2010).

Frobenius (hook) coordinates provide an alternative encoding: given a partition $s/t$4 with $s/t$5 diagonal boxes, the sequences $s/t$6, $s/t$7 (where $s/t$8 is the conjugate partition) for $s/t$9 encode the arm and leg lengths. Every hook length in $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$0 is $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$1 as $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$2, $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$3 range (Mironov et al., 2019).

A $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$4-core is a partition whose hookset contains no multiples of $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$5.

2. The Hookset–Numerical Monoids Correspondence

A central development is the identification of a bijection between hooksets and the complements of numerical monoids of given genus. For any numerical set $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$6 (contains 0, cofinite), its atom monoid $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$7 is a numerical monoid.

Theorem (Hooksets–Monoids correspondence): Among all partitions, hooksets of genus $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$8 are exactly the complements of numerical monoids of genus $$\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$$9:

$n$0

so that

$n$1

where $n$2 is the complement of $n$3 in nonnegative integers (Keith et al., 2010).

The construction uses labeled NE lattice paths (the partition profile): east (spacer) corresponds to $n$4, north (bead) to $n$5. A hook of length $n$6 arises when an east step at $n$7 and north at $n$8 imply $n$9, i.e., $\sum_{i=1}^k \lambda_i = n$0 is in the hookset if and only if it is not an atom of $\sum_{i=1}^k \lambda_i = n$1.

For $\sum_{i=1}^k \lambda_i = n$2-cores, partitions correspond to numerical sets with $\sum_{i=1}^k \lambda_i = n$3.

3. Structural Theorems and Sufficient Conditions

Key results govern when specific hooksets are realized and the structure of families of such partitions:

• Finite Simultaneous $\sum_{i=1}^k \lambda_i = n$4-core property: The set of partitions that are simultaneously $\sum_{i=1}^k \lambda_i = n$5-core for a set $\sum_{i=1}^k \lambda_i = n$6 is finite if and only if $\sum_{i=1}^k \lambda_i = n$7.
• Hook existence criteria: Given a set $\sum_{i=1}^k \lambda_i = n$8, if $\sum_{i=1}^k \lambda_i = n$9’s profile is strictly above the diagonal at positions distance $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$0 from its endpoints, then all required hooks $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$1 appear (Dyck-path criterion). This yields infinite families of partitions containing prescribed hooksets (Keith et al., 2010).
• Strict Dyck profile: If $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$2 is a strict Dyck path (profile always above the main diagonal except at endpoints), the hookset is the full initial segment $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$3.

Explicit formulae for $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$4-core generating functions for complete non-multiples-of-$$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$5 hooksets, together with abacus/bijection-based enumeration algorithms, are provided (Keith et al., 2010).

4. Hook Variables in Symmetric Functions and Operator Theory

The hook-variable (Frobenius) parametrization is pivotal for Schur functions, their variants, and the associated operators:

• Schur and skew Schur functions: Ordinary, shifted, and skew Schur functions admit determinant formulas in Frobenius coordinates. For ordinary Schur functions,

$$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$6

where $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$7 is the single-hook Schur function (Mironov et al., 2019).

• Cut-and-join operators: The usual operators $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$8 diagonalize on $$\lambda_1 \geq \lambda_2 \geq \cdots \geq \lambda_k \geq 1$$9, and expand in hook variables solely over single-hook diagrams once unit cycles are removed from $\lambda_j$0.
• Casimir and Ruijsenaars Hamiltonians: SL$\lambda_j$1 Casimir operators $\lambda_j$2 act diagonally with eigenvalues in hook variables; their generating function yields the $\lambda_j$3 Ruijsenaars Hamiltonian, which also admits a single-hook expansion.
• Multicomponent (Matisse) KP $\lambda_j$4-functions: Products of single-hook Schur functions in different times generate new integrable $\lambda_j$5-functions, with the combinatorics governed by Frobenius data.

5. Quantitative Results, Bounds, and Enumerative Applications

The bijection equips the study of hooksets with enumerative methods from numerical semigroup theory:

• For $\lambda_j$6-core families (where all $\lambda_j$7 are contained in the atom monoid), the largest possible hook length (outer hook) is bounded above by the Frobenius number $\lambda_j$8 of the corresponding numerical monoid. Thus, the partition size $\lambda_j$9 (Keith et al., 2010).
• For $j$0 coprime, $j$1 gives explicit upper bounds.
• The number of partitions whose hookset is $j$2 is equinumerous with numerical sets $j$3 whose atom monoid is $j$4.
• An explicit generating function for 3-cores with complete hooksets is established:

$j$5

where $j$6 is the number of 3-cores of size $j$7 whose hookset is all non-multiples of 3 up to the maximal hook.

6. Connections with Numerical Semigroups and Open Problems

There is a deep and structurally rich interplay between hooksets and numerical semigroup theory (Keith et al., 2010):

• The number $j$8 of numerical monoids of genus $j$9 appears conjectured to obey Fibonacci-like recursion $(i, j)$0; this is mirrored in the enumeration of partitions with maximal hookset $(i, j)$1.
• Tools from numerical semigroup theory (Apéry sets, Wilf’s conjecture) may be transferred to hookset combinatorics, suggesting new approaches to open enumeration and uniqueness problems (e.g., the nonuniqueness of a partition for a given hookset).
• Enumeration of the number of partitions with a given hookset, or distinguishing partitions by both hookset and part-multiset, remains an open problem.

This suggests cross-fertilization between partition theory and numerical semigroup theory, potentially yielding new enumeration results and structural insights.

7. Summary and Outlook

Hooksets function both as combinatorial invariants and as the optimal coordinate system for a range of algebraic and analytic structures associated with partitions and Young diagrams. Their correspondence with numerical monoids grants access to structural theorems, sharp enumerative bounds, explicit parametrizations for cores and prescribed hooksets, and operational benefits for symmetric functions, integrable systems, and representation theory (Keith et al., 2010, Mironov et al., 2019). Ongoing research aims to further classify hooksets, prove conjectured enumeration formulae, and extend the interplay with operator theory and matrix models.