On the enumeration of the set of numerical semigroups with fixed Frobenius number

Abstract

In this paper, we present an efficient algorithm to compute the whole set of numerical semigroups with a given Frobenius number F . The methodology is based on the construction of a partition of that set by a congruence relation. It is proven that each class in the partition contains exactly one irreducible and one homogeneous numerical semigroup, and from… (More)
DOI: 10.1016/j.camwa.2011.12.034

Topics

Cite this paper

@article{Blanco2012OnTE, title={On the enumeration of the set of numerical semigroups with fixed Frobenius number}, author={V{\'i}ctor Blanco and Jos{\'e} Carlos Rosales}, journal={Computers & Mathematics with Applications}, year={2012}, volume={63}, pages={1204-1211} }