• Methodology devised for the generation of congruent distributions in modular spaces. Formulation problem terms Number Theory. Mathematical generalization Walker, Draim, and Flower Constellations. Devised optimization techniques distribution problems. The methodology allows to limit size searching space. This work introduces n -dimensional lattices using necklaces, a general generate uniform m...

In this paper we present an algorithm for generating the lexicographi-cally smallest representatives of all the n-bead necklaces in k-colors. The time required is O(nN n k), where N n k is the number of necklaces with n beads of k colors. To our knowledge, this is the rst algorithm for this problem which has been proved to asymptotically improve the obvious O(n k n) approach of examining all k-...

Two words u and v are k-abelian equivalent if for each word x of length at most k, x occurs equally many times as a factor in both u and v. The notion of k-abelian equivalence is an intermediate notion between the abelian equivalence and the equality of words. In this paper, we study the equivalence classes induced by the k-abelian equivalence, mainly focusing on the cardinalities of the classe...

Halin graphs are planar 3-connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis.

We model both concurrent programs and the possible executions from one state to another in a concurrent program using simplices. The latter are calculated using necklaces of simplices in the former.

Based on an exact trace formula for a one-dimensional ray-splitting system, we derive novel combinatorial identities for cyclic binary sequences (Pólya necklaces). 02.10.Eb, 02.30.Lt, 05.45.+b Typeset using REVTEX 1