The complexity of a numerical semigroup

Publication date 20 September 2023

Abstract: Let

S

and

D e l t a

be numerical semigroups. A numerical semigroup

S

is an

m a t h b f I (D e l t a)

-{it semigroup} if

is an ideal of

D e l t a

. We will denote by

mathbf{I}(Delta)

We will say that

D e l t a

is {it an ideal extension of }

S

if

S i n m a t h c a l J (D e l t a) .

In this work, we present an algorithm that allows to build all the ideal extensions of a numerical semigroup. We can recursively denote by

m a t h c a l J^{0} (m a t h b b N) = m a t h b b N,

m a t h c a l J^{1} (m a t h b b N) = m a t h c a l J (m a t h b b N)

and

m a t h c a l J^{k + 1} (m a t h b b N) = m a t h c a l J (m a t h c a l J^{k} (m a t h b b N))

for all

k i n m a t h b b N .

The complexity of a numerical semigroup

S

is the minimun of the set

k i n m a t h b b N m i d S i n m a t h c a l J^{k} (m a t h b b N) .

In addition, we will give an algorithm that allows us to compute all the numerical semigroups with fixed multiplicity and complexity.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: The complexity of a numerical semigroup