Necklace(n, m, opts)
posint; length of necklace
posint; size of alphabet
(optional) equation(s) of the form option = value; specify options for the Necklace command
compile = truefalse
True means compile the iterator. The default is true.
rank = nonnegint
Specify the starting rank of the iterator. The default is one. The starting rank reverts to one when the iterator is reset, reused, or copied.
The Necklace command returns an iterator that generates all m-ary necklaces of length n, in lexicographic order. The alphabet consists of the integers from 0 to m−1.
A necklace is an equivalence class of strings under rotation. The representative of a class is the smallest string, lexicographically, in the class.
The iterator object has the following methods. The self parameter is the iterator object.
Number(self): return the number of iterations required to step through the iterator, assuming it started at rank one.
Rank(self,L): return the rank of the current iteration. Optionally pass L, a list or one-dimensional rtable, and return its rank.
Unrank(self,rnk): return a one-dimensional Array corresponding to the iterator output with rank rnk.
Create an iterator that generates all necklaces of length 4 in a 2-character alphabet.
0 0 0 0
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 1 1 1
Compute the number of iterations.
Compute the rank of an element in the sequence.
Compute the necklace corresponding to a given rank.
Knuth, Donald Ervin. The Art of Computer Programming, volume 4, fascicle 2; generating all tuples and permutations, sec. 184.108.40.206, generating all n-tuples, pp. 26-27.
ibid, Algorithm F, prime and preprime string generation, p. 27.
Practical Algorithms to Rank Necklaces, Lyndon Words, and de Bruijn Sequences, Joe Sawada and Aaron Williams, Journal of Discrete Algorithms, vol. 43, March 2017, pp. 95-110.
The Iterator[Necklace] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document
What kind of issue would you like to report? (Optional)