Prenecklace(n, m, opts)
posint; length of prenecklace
posint; size of alphabet
(optional) equation(s) of the form option = value; specify options for the Prenecklace command
compile = truefalse
True means compile the iterator. The default is true.
The Prenecklace 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 prenecklace 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.
Create an iterator that generates all prenecklaces of length 4 in an alphabet with 2 characters.
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 1
0 1 1 0
0 1 1 1
1 1 1 1
Compute the number of iterations.
Knuth, Donald Ervin. The Art of Computer Programming, volume 4, fascicle 2; generating all tuples and permutations, sec. 22.214.171.124, 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[Prenecklace] 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)