Now showing items 1-4 of 4

• #### An algorithm to compute the primitive elements of an embedding dimension three numerical semigroups ﻿

(2014)
Article
Open Access
We give an algorithm to compute the set of primitive elements for an embedding dimension three numerical semigroups. We show how we use this procedure in the study of the construction of L-shapes and the tame degree of the ...
• #### Computing denumerants in numerical 3-semigroups ﻿

(2018)
Article
Open Access
As far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium-large (about a thousand digits) input data in a reasonably time cost on an ordinary ...
• #### Denumerants of 3-numerical semigroups ﻿

(2014)
Article
Open Access
Denumerants of numerical semigroups are known to be difficult to obtain, even with small embedding dimension of the semigroups. In this work we give some results on denumerants of 3-semigroups S=<a,b,c>S=<a,b,c>. Closed ...
• #### On the number of L-shapes in embedding dimension four numerical semigroups ﻿

(2015-12-06)
Article
Open Access
Minimum distance diagrams, also known as L-shapes, have been used to study some properties related to weighted Cayley digraphs of degree two and embedding dimension three numerical semigroups. In this particular case, it ...