Pólya enumeration theorem
0 sources
Pólya enumeration theorem
Summary
Pólya enumeration theorem is a theorem[1]. It draws 167 Wikipedia views per month (theorem category, ranking #174 of 1,306).[2]
Key Facts
- Pólya enumeration theorem is credited with the discovery of J. Howard Redfield[3].
- Pólya enumeration theorem's instance of is recorded as theorem[4].
- George Pólya is named after Pólya enumeration theorem[5].
- J. Howard Redfield is named after Pólya enumeration theorem[6].
- Pólya enumeration theorem's part of is recorded as list of theorems[7].
- Pólya enumeration theorem's Freebase ID is recorded as /m/0c0081[8].
- Pólya enumeration theorem's Encyclopædia Britannica Online ID is recorded as topic/Polyas-theorem[9].
- Pólya enumeration theorem's statement describes is recorded as orbit of a group action[10].
- Pólya enumeration theorem's defining formula is recorded as |Y^X/G| = \frac{1}{|G|}\sum_{g \in G} m^{c(g)}[11].
- Pólya enumeration theorem's studied by is recorded as combinatorics[12].
- Pólya enumeration theorem's MathWorld ID is recorded as PolyaEnumerationTheorem[13].
- Pólya enumeration theorem's nLab ID is recorded as Pólya enumeration theorem[14].
- Pólya enumeration theorem's maintained by WikiProject is recorded as WikiProject Mathematics[15].
- Pólya enumeration theorem's Microsoft Academic ID is recorded as 54922343[16].
- Pólya enumeration theorem's generalization of is recorded as Burnside's lemma[17].
Body
Works and Contributions
Pólya enumeration theorem is credited with the discovery of J. Howard Redfield[3].
Why It Matters
Pólya enumeration theorem draws 167 Wikipedia views per month (theorem category, ranking #174 of 1,306).[2] It has Wikipedia articles in 10 language editions, a strong signal of global cultural recognition.[18] It is known by 15 alternative names across languages and contexts.[19]