Necklace Polynomial Calculator

Burnside necklace counting

CalculatorsFreeNo Signup
4.6(775 reviews)
All Tools

Loading tool...

About Necklace Polynomial Calculator

A necklace polynomial calculator using Burnside's lemma to count distinct necklaces (rotation equivalence) and bracelets (rotation + reflection). For n beads with k colors: necklaces = (1/n)Σ_{d|n} φ(d)·k^(n/d). Client-side.

Necklace Polynomial Calculator Features

  • Necklace count
  • Bracelet count
  • Burnside formula
  • Euler totient
  • Color choices
Necklaces: distinct circular arrangements of n beads in k colors, up to rotation. Count: M(n,k)=(1/n)Σ_{d|n}φ(d)·k^{n/d}. Bracelets add reflection symmetry. Uses Burnside's lemma and Euler's totient function.

How to Use

Enter n beads and k colors:

  • Necklaces: Rotations only
  • Bracelets: +reflections
  • Formula: Burnside breakdown

Burnside's Lemma

Count orbits = (1/|G|)Σ_{g∈G}|Fix(g)|. For rotations: rotation by d positions fixes colorings periodic with period gcd(d,n). The formula simplifies to (1/n)Σ_{d|n}φ(d)·k^{n/d}.

Applications

Chemistry (cyclic molecules), music theory (pitch class sets), combinatorial design, coding theory (cyclic codes), and DNA sequence analysis all use necklace counting.

Step-by-Step Instructions

  1. 1Enter bead count.
  2. 2Enter color count.
  3. 3Compute necklaces.
  4. 4Compute bracelets.
  5. 5View formula.

Necklace Polynomial Calculator — Frequently Asked Questions

What's the difference between necklaces and bracelets?+

Necklaces: two arrangements are same if one is a rotation of the other. Bracelets: same if one is a rotation OR reflection. So bracelets ≤ necklaces. For n≥3: bracelets ≈ necklaces/2 (since reflection roughly halves).

Why does Euler's totient appear?+

φ(d) counts rotations of order d. A rotation by j positions has order n/gcd(j,n)=d iff gcd(j,n)=n/d. The number of such j is φ(d). Each fixes k^{n/d} colorings (periodic with period n/d). Burnside sums these.

How do binary necklaces relate to shift registers?+

Binary necklaces (k=2) count equivalence classes of binary strings under cyclic shift. These correspond to cycles of linear feedback shift registers (LFSRs). The count (1/n)Σ_{d|n}φ(d)·2^{n/d} is fundamental in coding theory.

Share this tool: