Pólya enumeration theorem

Pólya enumeration theorem

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

The Pólya enumeration theorem, also known as the Redfield–Pólya theorem and Pólya counting, is a theorem in combinatorics that both follows from and ultimately generalizes Burnside's lemma on the number of orbits of a group action on a set. The theorem was first published by J. Howard Redfield in 1927.

Excerpt from the Wikipedia article “Pólya enumeration theorem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Pólya enumeration theorem to your collection.

Play for free

Related cards