The covariety of saturated numerical semigroups with fixed Frobenius number

Abstract: In this work we will show that if

F

is a positive integer, then

m a t h r m S a t (F) = S m i d S m b o x i s a s a t u r a t e d n u m e r i c a l s e m i g r o u p w i t h F r o b e n i u s n u m b e r F

is a covariety. As a consequence, we present two algorithms: one that computes

m a t h r m S a t (F),

and the other which computes all the elements of

m a t h r m S a t (F)

with a fixed genus. If

for some

S i n m a t h r m S a t (F),

then we will see that there is the least element of

m a t h r m S a t (F)

containing a

X

. This element will denote by

m a t h r m S a t (F) [X] .

If

S i n m a t h r m S a t (F),

then we define the

m a t h r m S a t (F)

-rank of

S

as the minimum of

m b o x c a r d i n a l i t y (X) m i d S = m a t h r m S a t (F) [X] .

In this paper, also we present an algorithm to compute all the element of

m a t h r m S a t (F)

with a given

m a t h r m S a t (F)

-rank.

This page was built for publication: The covariety of saturated numerical semigroups with fixed Frobenius number