On the smallest partition associated to a numerical semigroup
Abstract
The set of hook lengths of an integer partition λ \lambda is the complement of some numerical semigroup S S . There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about the distribution of sizes of this finite set of partitions. We focus on the problem of determining the size of the smallest partition with its set of hook lengths equal to N ∖ S \mathbb {N}\setminus S .
Fields of Study & Subjects
Functional Equations Stability Results
Commutative Algebra and Its Applications
Graph theory and applications
Publication details
- Journal / source
- Contemporary mathematics - American Mathematical Society
- Pages
- 55–78
- Publication date
- 1 January 2026
- Language
- EN