  The combinatorial properties of partitions with various restrictions on their
hooksets are explored. A connection with numerical semigroups extends current
results on simultaneous s/t-cores. Conditions that suffice for a partition to
possess required hooks are developed.
