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

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

Conté: 1. Successions, continuïtat i derivació. 2. Integració i sèries.

We recall L-shapes, which are minimal distance diagrams, related to weighted 2-Cayley digraphs, and we give the number and the relation between minimal distance diagrams related to the same digraph. On the other hand, we ...

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

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