On cyclic 〈m,n〉-enumerations (Q4947158)

The words over a finite alphabet \(\{a_1,\ldots,a_n\}\) are considered. A word \(X\) is called an \((m,n)\)-word if 1) all letters occurring in each subword \(Y\) of the word \(X\) (the length of \(Y\) is equal to \(m\)) are different, 2) for each subword \(Y\) of the word \(X\), there exists a letter such that the number of occurrences of this letter in \(Y\) is odd. A word \(X\) is called a cyclic word if the number of occurrences of each letter in \(X\) is even. The first explicit construction of a cyclic \((m,n)\)-word is given for all \(m\), \(m\leq n\). The length of such a word is equal to \(m2^{n-\lceil m/2\rceil}\). An algorithm of transformation of this construction to a cyclic \((m,n)\)-enumeration is given.