Union of sets of lengths of numerical semigroups

Abstract: Let

S = l a n g l e a_{1}, l d o t s, a_{p} a n g l e

be a numerical semigroup,

s i n S

and

s f z (s)

its set of factorizations. The set of length is denoted by

m a t h c a l L (s) = t L (x_{1}, d o t s, x_{p}) m i d (x_{1}, d o t s, x_{p}) i n s f Z (s)

where

t L (x_{1}, d o t s, x_{p}) = x_{1} + l d o t s + x_{p}

. From these definitions, the following sets can be defined

e x t s f W (n) = s i n S m i d e x i s t s x i n s f z (s) e x t r m s u c h t h a t t L (x) = n

,

u (n) = c u p_{s i n e x t s f W (n)} m a t h c a l L (s) = l_{1} < l_{2} < l d o t s < l_{r}

and

D e l t a u (n) = l_{2} - l_{1}, l d o t s, l_{r} - l_{r - 1}

. In this paper, we prove that the set

D e l t a u (S) = c u p_{n i n m a t h b b N} D e l t a u (n)

is almost periodic with period

m l c m (a_{1}, a_{p})

.

This page was built for publication: Union of sets of lengths of numerical semigroups