ALMOST-POSITIONED NUMERICAL SEMIGROUPS

In this talk we give algorithmics for computing the whole set of almost-positioned numerical semigroup with fixed multiplicity and Frobenius number. Moreover, we prove Wilf's conjecture for this type of numerical semigroups.
Joint work with J.C. Rosales and M.C. Faria.