Necklace (combinatorics)

The 3 **bracelets** with 3 red and 3 green beads. The one in the middle is chiral, so there are 4 **necklaces**.
Compare box(6,9) in the triangle.

The 11 **bracelets** with 2 red, 2 yellow and 2 green beads. The leftmost one and the four rightmost ones are chiral, so there are 16 **necklaces**.
Compare box(6,7) in the triangle.

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 of up to k different 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 then 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, 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

There are

N_{k}(n)={\frac {1}{n}}\sum _{d\mid n}\varphi (d)k^{\frac {n}{d}}

different k-ary necklaces of length n, where $\varphi$ is Euler's totient function.^[1]

Number of bracelets

There are

B_{k}(n)={\begin{cases}{\tfrac {1}{2}}N_{k}(n)+{\tfrac {1}{4}}(k+1)k^{\frac {n}{2}}&{\text{if }}n{\text{ is even}}\\[10px]{\tfrac {1}{2}}N_{k}(n)+{\tfrac {1}{2}}k^{\frac {n+1}{2}}&{\text{if }}n{\text{ is odd}}\end{cases}}

different k-ary bracelets of length n, where N_k(n) is the number of k-ary necklaces of length n. This follows 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\}$ .

Examples

Necklace example

If there are n beads, all distinct, on a necklace joined at the ends, then the number of distinct orderings on the necklace, after allowing for rotations, is ⁠n!/n⁠, for n > 0. This may also be expressed as (n − 1)!. This number is less than the general case, which lacks the requirement that each bead must be distinct.

An intuitive justification for this can be given. If there is a line of n distinct objects ("beads"), the number of combinations would be n!. If the ends are joined together, the number of combinations are divided by n, as it is possible to rotate the string of n beads into n positions.

Bracelet example

If there are n beads, all distinct, on a bracelet joined at the ends, then the number of distinct orderings on the bracelet, after allowing for rotations and reflection, is ⁠n!/2n⁠, for n > 2. Note that this number is less than the general case of B_n(n), which lacks the requirement that each bead must be distinct.

To explain this, one may begin with the count for a necklace. This number can be further divided by 2, because it is also possible to flip the bracelet over.

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)={\frac {1}{n}}\sum _{d\mid n}\mu (d)k^{\frac {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)\ =\ \sum \nolimits _{d|n}M_{k}(d),$ where the sum is over all divisors of n, which is equivlent by Möbius inversion to $M_{k}(n)\ =\ \sum \nolimits _{d|n}N_{k}(d)\,\mu ({\tfrac {n}{d}}).$

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

References

^ Weisstein, Eric W. "Necklace". MathWorld.

External links

[1] Weisstein, Eric W. "Necklace". MathWorld.

[1]