Necklace polynomial explained

In combinatorial mathematics, the necklace polynomial, or Moreau's necklace-counting function, introduced by, counts the number of distinct necklaces of n colored beads chosen out of α available colors, arranged in a cycle. Unlike the usual problem of graph coloring, the necklaces are assumed to be aperiodic (not consisting of repeated subsequences), and counted up to rotation (rotating the beads around the necklace counts as the same necklace), but without flipping over (reversing the order of the beads counts as a different necklace). This counting function also describes the dimensions in a free Lie algebra and the number of irreducible polynomials over a finite field.

Definition

The necklace polynomials are a family of polynomials

M(\alpha,n) in the variable \alpha such that\alpha ^{n} = \sum _{d|n} d M(\alpha, d).

By Möbius inversion they are given by

M(\alpha,n) = { 1 \over n}\sum _{d|n} \mu\left({n \over d}\right)\alpha ^{d,} where \mu is the classic Möbius function.

A closely related family, called the general necklace polynomial or general necklace-counting function, is:

N(\alpha,n) = \sum _{d|n} M(\alpha,d) = (1)/(n) \sum _{d|n} \varphi\left({n \over d}\right)\alpha ^{d,} where \varphi is Euler's totient function.

Applications

The necklace polynomials

M(\alpha,n) and N(\alpha,n) appear as:

• The number of aperiodic necklaces (or equivalently Lyndon words), which are cyclic arrangements of n colored beads having α available colors. Two such necklaces are considered equal if they are related by a rotation (not considering reflections). Aperiodic refers to necklaces without rotational symmetry, having n distinct rotations. Correspondingly,

N(\alpha,n) gives the number of necklaces including the periodic ones: this is easily computed using Pólya theory.

• The dimension of the degree n component of the free Lie algebra on α generators ("Witt's formula"^[1]), or equivalently the number of Hall words of length n. Correspondingly,

N(\alpha,n) should be the dimension of the degree n component of a free Jordan algebra.

• The number of monic irreducible polynomials of degree n over a finite field with α elements (when

\alpha = p ^{d} is a prime power). Correspondingly, N(\alpha,n) is the number of polynomials which are primary (a power of an irreducible).

• The exponent in the cyclotomic identity:

style { 1 \over 1- \alpha z} = \prod ^{inf ty\left({ 1} _{j =1} \over 1- z ^{j}\right)} .Although these various types of objects are all counted by the same polynomial, their precise relationships remain unclear. For example, there is no canonical bijection between the irreducible polynomials and the Lyndon words.^[2] However, there is a non-canonical bijection as follows. For any degree n monic irreducible polynomial over a field F with α elements, its roots lie in a Galois extension field L with \alpha ^{n} elements. One may choose an element x\in L such that \{x,\sigma x, ...,\sigma ^{n-1} x\} is an F-basis for L (a normal basis), where σ is the Frobenius automorphism \sigma y = y ^{\alpha} . Then the bijection can be defined by taking a necklace, viewed as an equivalence class of functions f:\{ 1 ,...,n\} → F , to the irreducible polynomial

\phi(T) = (T - y)(T - \sigma y) … (T - \sigma ^{n-1} y) \in F[T] for y = f( 1 )x + f( 2 )\sigma x + … + f(n)\sigma ^{n-1} x .

Different cyclic rearrangements of f, i.e. different representatives of the same necklace equivalence class, yield cyclic rearrangements of the factors of \phi(T) , so this correspondence is well-defined.^[3]

Relations between M and N

The polynomials for M and N are easily related in terms of Dirichlet convolution of arithmetic functions

f(n)*g(n) , regarding \alpha as a constant.

• The formula for M gives

nM(n) = \mu(n)*\alpha ^{n} ,

• The formula for N gives

nN(n) = \varphi(n)*\alpha ^{n} = n*\mu(n)*\alpha ^{n} .

• Their relation gives

N(n) =1 *M(n) or equivalently nN(n) = n*(nM(n)) , since the function f(n) = n is completely multiplicative.

Any two of these imply the third, for example:

n*\mu(n)*\alpha ^{n} = nN(n) = n*(nM(n)) \Longrightarrow \mu(n)*\alpha ^{n =} nM(n) by cancellation in the Dirichlet algebra.

Examples

\begin{align} M( 1 ,n) & = 0 if n> 1 \\[ 6 pt] M(\alpha, 1 ) & = \alpha \\[ 6 pt] M(\alpha, 2 ) & = \tfrac 12 (\alpha ^{2-\alpha)} \\[ 6 pt] M(\alpha, 3 ) & = \tfrac 13 (\alpha ^{3-\alpha)} \\[ 6 pt] M(\alpha, 4 ) & = \tfrac 14 (\alpha ^{4-\alpha} ^{2)} \\[ 6 pt] M(\alpha, 5 ) & = \tfrac 15 (\alpha ^{5-\alpha)} \\[ 6 pt] M(\alpha, 6 ) & = \tfrac 16 (\alpha ^{6-\alpha} ^{3-\alpha} ^{2+\alpha)} \\[ 6 pt] M(\alpha,p) & = \tfrac 1 p (\alpha ^{p} - \alpha) & if p isprime \\[ 6 pt] M(\alpha,p ^{N)} & = \tfrac 1 {p ^{N}(\alpha} ^{p ^{N}} - \alpha ^{p ^{N-1}} ) & if p isprime \end{align}

For

\alpha =2 , starting with length zero, these form the integer sequence

1, 2, 1, 2, 3, 6, 9, 18, 30, 56, 99, 186, 335, ...

Identities

See main article: Necklace ring. The polynomials obey various combinatorial identities, given by Metropolis & Rota:

M(\alpha\beta, n) = \sum _{\operatorname{lcm} (i,j) = n} \gcd(i,j)M(\alpha,i)M(\beta,j), where "gcd" is greatest common divisor and "lcm" is least common multiple. More generally,M(\alpha\beta … \gamma, n) = \sum _{\operatorname{lcm} (i,j,\ldots,k) = n} \gcd(i,j, … ,k)M(\alpha,i)M(\beta,j) … M(\gamma,k), which also implies:M(\beta ^{m,} n) = \sum _{\operatorname{lcm} (j,m) = nm} (j)/(n) M(\beta,j).

References

• • • Reutenauer . Christophe . Mots circulaires et polynomies irreductibles . Ann. Sc. Math. Quebec . 1988 . 12 . 2 . 275–285.

Notes and References

1. Book: Lothaire, M. . M. Lothaire

   . M. Lothaire . Perrin, D.; Reutenauer, C.; Berstel, J.; Pin, J. E.; Pirillo, G.; Foata, D.; Sakarovitch, J.; Simon, I.; Schützenberger, M. P.; Choffrut, C.; Cori, R.; Lyndon, Roger; Rota, Gian-Carlo. Foreword by Roger Lyndon . Combinatorics on words . 2nd . Encyclopedia of Mathematics and Its Applications . 17 . . 1997 . 978-0-521-59924-5 . 0874.20040 . 1475463 . 79,84 .

2. Amy Glen, (2012) Combinatorics of Lyndon words, Melbourne talk
3. Adalbert Kerber, (1991) Algebraic Combinatorics Via Finite Group Actions, https://books.google.com/books?id=Fe7uAAAAMAAJ