2011/05/20 by Víctor Blanco, V. Blanco, J. C. Rosales +2
Computer Science · Mathematics · #Commutative Algebra and Its Applications #Computational Drug Discovery Methods #Polynomial and algebraic computation #math.AC #math.CO #math.NT #math.OC #msc:05A18 #msc:11D07 #msc:20M14 #msc:90C10
paper · pdf · doi:10.48550/arxiv.1105.4600
11 pages
arxiv created 2011/05/20 · arxiv updated 2011/05/26
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one irreducible and one homogeneous numerical semigroup at each class in the relation, and from those two elements we reconstruct the whole class. An alternative more efficient method is proposed based on the use of the Kunz-coordinates vectors of the elements in S(F).