# Applying the Pólya-Burnside Enumeration Theorem

Initializing live version

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The Pólya–Burnside enumeration theorem is an extension of the Pólya–Burnside lemma, Burnside's lemma, the Cauchy–Frobenius lemma, or the orbit‐counting theorem.

[more]
Contributed by: Hector Zenil and Oleksandr Pavlyk (March 2011)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

## Permanent Citation