On the enumeration of the set of saturated numerical semigroups of a given genus
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Science+Business Media New York 2013
Abstract
In this paper we present an algorithm for computing the set of saturated
numerical semigroups of a given genus. We see how the set of saturated numerical
semigroups can be arranged in a tree rooted in N and we describe the sons of any
vertex of this tree.
Description
Keywords
Citation
title: One the enumeration of the set of saturated numerical semigroups of a given genus
authors: J.C. Rosales · M.B. Branco · D. Torrão Semigroup Forum Published online 6/12/2013