The right-generators descendant of a numerical semigroup
Combinatorics
2019-11-11 v1 Commutative Algebra
Abstract
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.
Keywords
Cite
@article{arxiv.1911.03173,
title = {The right-generators descendant of a numerical semigroup},
author = {Maria Bras-Amorós and Julio Fernández-González},
journal= {arXiv preprint arXiv:1911.03173},
year = {2019}
}
Comments
Accepted at Mathematics of Computation (AMS)