Union of sets of lengths of numerical semigroups
Abstract
Let S= a1,…,ap be a numerical semigroup, s∈ S and z(s) its set of factorizations. The set of length is denoted by L(s)=\ L(x1,…,xp) (x1,…,xp)∈ Z(s)\ where L(x1,…,xp)=x1+…+xp. From these definitions, the following sets can be defined W(n)=\s∈ S ∃ x∈ z(s) such that L(x)=n\, (n)=s∈ W(n) L(s)=\l1<l2<…< lr\ and (n)=\l2-l1,…,lr-lr-1\. In this paper, we prove that the set (S)=n∈N(n) is almost periodic with period lcm(a1,ap).
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.