Algorithms for numerical semigroups with fixed maximum primitive
Combinatorics
2026-01-01 v1
Abstract
We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's conjecture among the numerical semigroups with maximum primitive up to .
Cite
@article{arxiv.2512.23891,
title = {Algorithms for numerical semigroups with fixed maximum primitive},
author = {Manuel Delgado and Neeraj Kumar},
journal= {arXiv preprint arXiv:2512.23891},
year = {2026}
}