On the enumeration of the set of atomic numerical semigroups with fixed Frobenius number
Abstract
A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic numerical semigroup. Based on a previous one developed to obtain all irreducible numerical semigroups with a fixed Frobenius number, we present an algorithm to compute all atomic numerical semigroups with a fixed Frobenius number.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.