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

Sea GN un grupo abeliano finito de orden N. Para cada conjunto de generadores f, g = GN, consideremos el digrafo de Cayley Cay(GN, {f, g}). Seg´un sea GN c´ıclico o no c´ıclico, podemos obtener un di´ametro ´optimo ...

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