A realization theorem for sets of lengths in numerical monoids
Abstract
We show that for every finite nonempty set L of integers greater than or equal to 2 there are a numerical monoid H and a squarefree element a ∈ H whose set of lengths L(a) is equal to L.
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.