Geodesic
On Pólya's Theorem
Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 792-799

Voir la notice de l'article provenant de la source Cambridge University Press

In 1927 J. H. Redfield (9) stressed the intimate interrelationship between the theory of finite groups and combinatorial analysis. With this in mind we consider Pólya's theorem (7) and the Redfield-Read superposition theorem (8, 9) in the context of the theory of permutation representations of finite groups. We show in particular how the Redfield-Read superposition theorem can be deduced as a special case from a simple extension of Pólya's theorem. We give also a generalization of the superposition theorem expressed as the multiple scalar product of certain group characters. In a later paper we shall give some applications of this generalization. 
Sheehan, J. On Pólya's Theorem. Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 792-799. doi: 10.4153/CJM-1967-073-x
@article{10_4153_CJM_1967_073_x,
     author = {Sheehan, J.},
     title = {On {P\'olya's} {Theorem}},
     journal = {Canadian journal of mathematics},
     pages = {792--799},
     year = {1967},
     volume = {19},
     number = {1},
     doi = {10.4153/CJM-1967-073-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-073-x/}
}
TY  - JOUR
AU  - Sheehan, J.
TI  - On Pólya's Theorem
JO  - Canadian journal of mathematics
PY  - 1967
SP  - 792
EP  - 799
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-073-x/
DO  - 10.4153/CJM-1967-073-x
ID  - 10_4153_CJM_1967_073_x
ER  - 
%0 Journal Article
%A Sheehan, J.
%T On Pólya's Theorem
%J Canadian journal of mathematics
%D 1967
%P 792-799
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-073-x/
%R 10.4153/CJM-1967-073-x
%F 10_4153_CJM_1967_073_x

[1] 1. de Bruijn, N. G., Generalization of Pólya’s fundamental theorem in enumeriative combinatorial analysis, Indag. Math., 21 (1959), 59–69. Google Scholar

[2] 2. Burnside, W., Theory of groups of finite order, 2nd ed. (Cambridge, 1911). Google Scholar

[3] 3. Foulkes, H. O., On Redfield's group reduction functions, Can. J. Math., 15 (1963), 272–284. Google Scholar

[4] 4. Harary, F., The number of linear, directed, rooted, and connected graphs, Trans. Amer. Math. Soc. 78 (1955), 445–463. Google Scholar

[5] 5. Harary, F. and Palmer, E. M., The power group enumeration theorem, J. Combinatorial Theory, to appear. Google Scholar

[6] 6. Murnaghan, F. D., The theory of group representation, (Baltimore, 1938). Google Scholar

[7] 7. Pólya, G., Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen, und chemische Verbindungen, Acta Math., 68 (1938), 145–154. Google Scholar

[8] 8. Read, R. C., The enumeration of locally restricted graphs, I, J. London Math. Soc., 34 (1959), 417–436. Google Scholar

[9] 9. Redfield, J. H., The theory of group reduced distributions, Amer. J. Math., 49 (1927), 433–455. Google Scholar

[10] 10. Sheehan, J., The superposition of graphs (Thesis, Swansea, 1965). Google Scholar

Cité par Sources :