Comments on “Extremal Cayley Digraphs of Finite Abelian Groups” [Intercon. Networks 12 (2011), no. 1-2, 125–135]

We comment on the paper “Extremal Cayley digraphs of finite Abelian groups” [Intercon. Networks 12 (2011), no. 1-2, 125–135]. In particular, we give some counterexamples to the results presented there, and provide a correct result for degree two.Peer ReviewedPostprint (published version

Denumerants of 3-numerical semigroups

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=S=. Closed expressions are obtained under certain conditions.Peer ReviewedPostprint (published version

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

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 semigroup.Peer ReviewedPostprint (author’s final draft

Triple-loop networks with arbitrarily many minimum distance diagrams

Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that they have a very definite form "L-shape''. In contrast, in this paper we show that there are triple-loop networks with an arbitrarily big number of associated minimum distance diagrams. For doing this, we build-up on the relations between minimum distance diagrams and monomial ideals.Comment: 17 pages, 8 figure

Gossiping in chordal rings under the line model

The line model assumes long distance calls between non neighboring processors. In this sense, the line model is strongly related to circuit-switched networks, wormhole routing, optical networks supporting wavelength division multiplexing, ATM switching, and networks supporting connected mode routing protocols. Since the chordal rings are competitors of networks as meshes or tori because of theirs short diameter and bounded degree, it is of interest to ask whether they can support intensive communications (typically all-to-all) as efficiently as these networks. We propose polynomial algorithms to derive optimal or near optimal gossip protocols in the chordal ring