Pólya's enumeration theorem (Spanish: El teorema de enumeración de Pólya)
We wish to offer here a didactic presentation, mainly based on G. Pólya’s original paper and by the light of various examples, of a topic of Combinatorics: Pólya’s (and Redfield’s) enumeration theorem. Our excuses for it just being that an oral version was exposed in one of the sessions corresponding...
| Autores: | , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 2001 |
| País: | España |
| Institución: | Universidad Complutense de Madrid (UCM) |
| Repositorio: | Docta Complutense |
| Idioma: | español |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/60719 |
| Acceso en línea: | https://hdl.handle.net/20.500.14352/60719 |
| Access Level: | acceso abierto |
| Palabra clave: | 519.1 Pólya’s enumeration theorem necklace’s problem Análisis combinatorio 1202.05 Análisis Combinatorio |
| Sumario: | We wish to offer here a didactic presentation, mainly based on G. Pólya’s original paper and by the light of various examples, of a topic of Combinatorics: Pólya’s (and Redfield’s) enumeration theorem. Our excuses for it just being that an oral version was exposed in one of the sessions corresponding to the year 1991 of the “Seminario Permanente de Actualización en Matemáticas de Logroño”, a meeting place for secondary teacher’s and university professors that as much owes to Chicho’s passion for Mathematics. |
|---|