Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congruence in Z. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, ...

We give a method for constructing infinite families of dense (or eventually likely dense) Cayley digraphs of finite Abelian groups. The diameter of the digraphs is obtained by means of the related minimum distance diagrams. ...

Smart cities are becoming popular and, with them, a plethora of resources is emerging turning into a massive concentration of computing devices. In such environments, the deployment of a smart resources management system ...

Un semigrupo num erico generado por tres elementos tiene asociadas una o dos teselaciones peri odicas del plano generadas por una baldosa en forma de L. Se conocen algunas propiedades combinatorias del semigrupo en t ...

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 ...

Given a numerical semigroup S(A), generated by A = {a,b,N} ⊂ N with 0 < a < b < N and gcd(a,b,N) = 1, we give a parameterization of the set F(m;A) = {(x, y, z) ∈ $N^3$ | xa + yb + zN = m} for any m ∈ S(A). We also give the ...

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 ...