Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...
In this work we study the asymptotic traffic behaviour in Gromov's hyperbolic spaces when the traffic decays exponentially with the distance. We prove that under general condi...
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
We consider an ad hoc network which uses multihop routing and slotted ALOHA for its MAC contention. We show that the minimum time required for a packet to reach the destination fr...
—We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A cons...
Yeow Meng Chee, Alan C. H. Ling, San Ling, Hao She...