Paperlane

no. 16 · Tuesday 17 November 2026

Creation Sequences for Numerical Semigroups and Exact Counts of Semigroup Partitions

Rameez Raja and Zeenat Rashid

math.CO

Abstract

A numerical semigroup is a subset of the non-negative integers that contains $0$, is closed under addition and has finite complement. A threshold graph is built by adding vertices one at a time, each new vertex being isolated or dominating, and the record of these choices is its \emph{creation sequence}. Reading the creation sequence as a lattice path gives an integer partition and, through the Keith–Nath correspondence, a numerical set in which the dominating vertices are the elements and the isolated vertices are the gaps. We show that threshold graphs with an isolated vertex correspond bijectively to numerical sets, and we study numerical semigroups through their creation sequences. We prove that in the creation sequence of a numerical semigroup of multiplicity $m$ every block of ones and every non-initial block of zeros has length less than $m$, we give criteria for partitions with a unique smallest part and with two distinct part sizes, and we classify all partitions with at most four parts. We show that every partition $λ$ with $g$ parts corresponding to a numerical semigroup satisfies $\ell(λ)\geλ_1$ and, more strongly, fits inside the staircase $(g,g-1,\dots,1)$; equivalently, its creation sequence begins with a Dyck path. Its size equals the genus plus the Weierstrass weight of the semigroup, and asymptotically at most half of all partitions correspond to numerical semigroups. Finally, we obtain exact formulas for the numbers of partitions of $n$ corresponding to numerical semigroups of genus $g$, multiplicity $m$ and Frobenius number $f$, valid in the sharp ranges $g\ge n/2$, $m>n/3$ and $f\ge n-\frac{n-1}{4}$. These formulas solve the open problems posed by Burson, Nam and Sisneros-Thiry \cite{BNS}, recover all of their counting theorems, and correct several of their statements.

fields
Combinatorics
pdf ↗ page arXiv:2611.20832 ↗