Necklace polynomial

Necklace polynomial

In combinatorial mathematics, the necklace polynomials, or (Moreau's) necklace-counting function are the polynomials M(α,n) in α 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 μ is the classic Möbius function.

The necklace polynomials are closely related to the functions studied by C. Moreau (1872), though they are not quite the same: Moreau counted the number of necklaces, while necklace polynomials count the number of aperiodic necklaces.

The necklace polynomials appear as:

  • the number of aperiodic necklaces (also called Lyndon words) that can be made by arranging n beads the color of each of which is chosen from a list of α colors (One respect in which the word "necklace" may be misleading is that if one picks such a necklace up off the table and turns it over, thus reversing the roles of clockwise and counterclockwise, one gets a different necklace, counted separately, unless the necklace is symmetric under such reflections.);
  • the dimension of the degree n piece of the free Lie algebra on α generators
  • the number of monic irreducible polynomials of degree n over a finite field with α elements (when α is a prime power).
  • the exponent in the cyclotomic identity.
  • The number of Lyndon words of length n in an alphabet of size α.

Values

  • M(α,1) = α
  • M(α,2) = (α2 − α)/2
  • M(α,3) = (α3 − α)/3
  • M(α,4) = (α4 − α2)/4
  • M(α,5) = (α5 − α)/5
  • M(α,6) = (α6 − α3 − α2 + α)/6
  • M(α,pn) = (αpn − αpn − 1)/pn for p prime
  • \displaystyle M(\alpha\beta, n)=\sum_{[i,j]=n}(i,j)M(\alpha,i)M(\beta,j) where (i,j) is the highest common factor of i and j and [i,j] is their least common multiple.

See also

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Necklace ring — In mathematics, the necklace ring is a ring introduced by Metropolis and Rota (1983). Definition If A is a commutative ring then the necklace ring over A consists of all infinite sequences (a1,a2,...) of elements of A. Addition in the… …   Wikipedia

  • Free Lie algebra — In mathematics, a free Lie algebra, over a given field K, is a Lie algebra generated by a set X, without any imposed relations. Contents 1 Definition 2 Universal enveloping algebra 3 Hall sets …   Wikipedia

  • Novikov self-consistency principle — The Novikov self consistency principle, also known as the Novikov self consistency conjecture, is a principle developed by Russian physicist Igor Dmitriyevich Novikov in the mid 1980s to solve the problem of paradoxes in time travel, which is… …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • List of mathematics articles (N) — NOTOC N N body problem N category N category number N connected space N dimensional sequential move puzzles N dimensional space N huge cardinal N jet N Mahlo cardinal N monoid N player game N set N skeleton N sphere N! conjecture Nabla symbol… …   Wikipedia

  • List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… …   Wikipedia

  • Luke Pebody — Luke Thomas Pebody (born 1977) is a mathematician who solved the necklace problem. Educated at Rugby School, Luke Pebody was admitted to Cambridge University at the age of 14 to read mathematics. He went up when he was 16, making him one of the… …   Wikipedia

  • Lyndon word — In mathematics, in the areas of combinatorics and computer science, a Lyndon word is a certain type of string over an alphabet. Several equivalent definitions are possible.A k ary Lyndon word of length n is an n character string over an alphabet… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”