A combinatorial problem and numerical semigroups

Abstract: Let

a = (a_{1}, l d o t s, a_{n})

and

b = (b_{1}, l d o t s, b_{n})

be two

n

-tuples of positive integers, let

X

be a set of positive integers, and let

g

be a positive integer. In this work we show an algorithmic process in order to compute all the sets

C

of positive integers that fulfill the following conditions: 1) the cardinality of

C

is equal to

g

; 2) if

x, y i n m a t h b b N s e t m i n u s 0

and

x + y i n C

, then

C c a p x, y e q e m p t y s e t

; 3) if

x i n C

and

f r a c x - b_{i} a_{i} i n m a t h b b N s e t m i n u s 0

for some

i i n 1, l d o t s, n

, then

f r a c x - b_{i} a_{i} i n C

; 4)

X c a p C = e m p t y s e t

.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: A combinatorial problem and numerical semigroups