Maria Bras-Amorós, Julio Fernández-González
Published 2019-11-08Version 1
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an efficient algorithm for exploring the tree up to a given genus. The algorithm exploits the second nonzero element of a numerical semigroup and the particular pseudo-ordinary case in which this element is the conductor.
Comments: Accepted at Mathematics of Computation (AMS)
The set of numerical semigroups of a given genus
Numerical semigroups, polyhedra, and posets IV: walking the faces of the Kunz cone
On faces of the Kunz cone and the numerical semigroups within them
![QR code for arXiv:1911.03173 [math.CO]](http://oss.arxitics.com/images/favicon.svg)