Authorization

 

Journal

Volume 20, №3

 
Algorithms for Calculating the Set of Integers Contained in a Monoid Finitely Generated by Positive Rational Numbers (pages: 381-389)
J.C. Rosales, M.B. Branco


 Abstract. Given q1, . . . , qe ∈ Q0+, we denote by ⟨q1,… , qe⟩ the smallest submonoid of (Q0+,+) containing {q1,… , qe}. Clearly, ⟨q1,… , qe⟩ ∩N is a submonoid of (N, +) and it is denoted here by S(q1,… , qe). We present in this paper a method that allows to calculate a finite system of generators of S(q1,… , qe). More specifically, we give three algorithms to solve this problem, two of them in general and one for the particular case of e = 2.

Keywords: Numerical Semigroup, Full Semigroup, Linear Diophantine Equation, Apery Set,

Proportionally Modular Diophantine Inequality.

 

AMS Subject Classification: 20M14, 11Y50.

 

 

 



COIA 2027

7-9 July 2027
Baku, Azerbaijan

Search