Necklace (combinatorics) explained

In combinatorics, a k-ary necklace of length n is an equivalence class of n-character strings over an alphabet of size k, taking all rotations as equivalent. It represents a structure with n circularly connected beads which have k available colors.

A k-ary bracelet, also referred to as a turnover (or free) necklace, is a necklace such that strings may also be equivalent under reflection. That is, given two strings, if each is the reverse of the other, they belong to the same equivalence class. For this reason, a necklace might also be called a fixed necklace to distinguish it from a turnover necklace.

Formally, one may represent a necklace as an orbit of the cyclic group acting on n-character strings over an alphabet of size k, and a bracelet as an orbit of the dihedral group. One can count these orbits, and thus necklaces and bracelets, using Pólya's enumeration theorem.

Equivalence classes

Number of necklaces

See main article: Necklace polynomial. There are

N _{k(n) = (1)/(n)} \sum _{d\mid} \varphi(d)k ^{n/d} = (1)/(n) \sum ^{n} _{i =1} k (i, n)}

different k-ary necklaces of length n, where

\varphi is Euler's totient function. When the beads are restricted to particular color multiset l{B} = \{ 1 ^{n _{1}} ,\ldots,k ^{n _{k}} \} , where n _{i} is the number of beads of color i \in \{ 1 ,\ldots,k\} , there areN( l{B}) = (1)/(| l{B) |} \sum _{d} (n _{1,\ldots,n} _{k)}} {| l{B}|/d \choose n _{1} /d, \ldots, n _{k} /d} \phi(d)

different necklaces made of all the beads of

l{B} . ^[1] Here | l{B}| : = \sum\limits ^{k} _{i =1} n _{i} and {m \choose m _{1,} \ldots, m _{k}} : = (m!)/(m _{1!} … m _{k!}) is the multinomial coefficient.These two formulas follow directly from Pólya's enumeration theorem applied to the action of the cyclic group C _{n} acting on the set of all functions f : \{ 1 ,\ldots,n\} \to\{ 1 ,\ldots,k\} .If all k colors must be used, the count is L _{k(n) = (k!)/(n)} \sum _{d\mid} \varphi(d)S\left( (n)/(d) , k\right) , where S(n, k) are the Stirling number of the second kind. N _{k(n)} and L _{k(n)} are related via the Binomial coefficients: N _{k(n)=\sum} ^{k\binom{k}{j}} ^{j =1} L _{j(n)} and L _{k(n)=\sum} ^{k( -1 )} ^{j =1} ^{k-j} \binom{k}{j}N _{j(n)}

Number of bracelets

The number of different k-ary bracelets of length n is

B _{k(n)} = \begin{cases} \tfrac 12 N _{k(n)} + \tfrac 14 (k +1 )k ^{n/2} & if n iseven \\[ 10 px] \tfrac 12 N _{k(n)} + \tfrac 12 k ^{(n+1)/2} & if n isodd \end{cases} , where N_k(n) is the number of k-ary necklaces of length n. This follows from Pólya's method applied to the action of the dihedral group D _{n} .

Case of distinct beads

For a given set of n beads, all distinct, the number of distinct necklaces made from these beads, counting rotated necklaces as the same, is = (n − 1)!. This is because the beads can be linearly ordered in n! ways, and the n circular shifts of such an ordering all give the same necklace. Similarly, the number of distinct bracelets, counting rotated and reflected bracelets as the same, is, for n ≥ 3.

If the beads are not all distinct, having repeated colors, then there are fewer necklaces (and bracelets). The above necklace-counting polynomials give the number necklaces made from all possible multisets of beads. Polya's pattern inventory polynomial refines the counting polynomial, using variable for each bead color, so that the coefficient of each monomial counts the number of necklaces on a given multiset of beads.

Aperiodic necklaces

An aperiodic necklace of length n is a rotation equivalence class having size n, i.e., no two distinct rotations of a necklace from such class are equal.

According to Moreau's necklace-counting function, there are

M _{k(n) = (1)/(n)} \sum _{d\mid} \mu(d)k ^{n/d}

different k-ary aperiodic necklaces of length n, where μ is the Möbius function. The two necklace-counting functions are related by: $N\_k(n)\; =\; \backslash sum\_\; M\_k(d),$ where the sum is over all divisors of n, which is equivalent by Möbius inversion to $M\_k(n)\; =\; \backslash sum\_\; N\_k(d)\backslash ,\backslash mu\backslash bigl(\backslash tfrac\backslash bigr).$

Each aperiodic necklace contains a single Lyndon word so that Lyndon words form representatives of aperiodic necklaces.

See also

• Lyndon word
• Inversion (discrete mathematics)
• Necklace problem
• Necklace splitting problem
• Permutation
• Proofs of Fermat's little theorem#Proof by counting necklaces
• Forte number, a representation of binary bracelets of length 12 used in atonal music.

External links

• Book: Polya . Georg . Read . R.C. . Aeppli . Dorothee . Combinatorial enumeration of groups, graphs, and chemical compounds . Springer-Verlag . 1987 . 9780387964133.
• Frank . Ruskey . Carla . Savage . Terry Min Yih . Wang . Generating necklaces . Journal of Algorithms . 13 . 3 . 414–430 . 1992 . 10.1016/0196-6774(92)90047-G .

Notes and References

1. Web site: Frank . Ruskey . Info on necklaces, Lyndon words, De Bruijn sequences . https://web.archive.org/web/20061002130346/http://www.theory.csc.uvic.ca/~cos/inf/neck/NecklaceInfo.html . 2006-10-02 . 2006 .