An infinite version of the Pólya enumeration theorem (Q1205609)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An infinite version of the Pólya enumeration theorem |
scientific article; zbMATH DE number 147576
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infinite version of the Pólya enumeration theorem |
scientific article; zbMATH DE number 147576 |
Statements
An infinite version of the Pólya enumeration theorem (English)
0 references
1 April 1993
0 references
An infinite version of the Pólya enumeration theorem is given to count the number of orbits of a countable discrete group acting as permutations on a countable set.
0 references
Pólya enumeration theorem
0 references
discrete group
0 references
permutations
0 references
0.90135837
0 references
0.8997372
0 references
0.8860284
0 references
0.8786842
0 references
0.87811667
0 references
