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

In this paper, we present an efficient algorithm to compute the set of saturated numerical semigroups with a given Frobenius number.

Bibliographic Details
Main Author: J.C. Rosales, Rosales (author)
Other Authors: M. B. Branco, Branco (author), D. Torrão, Torrão (author)
Format: article
Language:eng
Published: 2015
Subjects:
Numerical semigroup;
Frobenius number
Satudeted
Online Access:http://hdl.handle.net/10174/13099
Country:Portugal
Oai:oai:dspace.uevora.pt:10174/13099
Description
Summary:In this paper, we present an efficient algorithm to compute the set of saturated numerical semigroups with a given Frobenius number.

Similar Items