The Number of Saturated Numerical Semigroups with a Determinate Genus
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
In this work we describe the saturated numerical semigroups, and characterize the SAT system of generators for them. We see how we can arrange them in a tree rooted in NN and describe the sons of any vertex of this tree. Finally, we present an algorithm for computing the set of saturated numerical semigroups of a given genus
Description
Citation
Dynamics, Games and Science
Volume 1 of the series CIM Series in Mathematical Sciences pp 607-616