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

Abstract

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

Description

Citation

Applied Mathematics and Computation, Volume 236, 1 June 2014, Pages 471–479, doi:10.1016/j.amc.2014.03.058

Endorsement

Review

Supplemented By

Referenced By