Geodesic
On Redfield's Range-Correspondences
Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 1060-1071

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

In an important paper (7), long overlooked, J. H. Redfield dealt with several aspects of enumerative combinatorial analysis. In a previous paper (1) I showed the relation between a certain repeated scalar product of a set of permutation characters of a symmetric group and Redfield's composition of his group reduction functions. Here I consider, from a group representational point of view, Redfield's idea of a range-correspondence and its application to enumeration of linear graphs. The details of the application of these ideas to more general enumerations are also given. 
Foulkes, H. O. On Redfield's Range-Correspondences. Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 1060-1071. doi: 10.4153/CJM-1966-105-5
@article{10_4153_CJM_1966_105_5,
     author = {Foulkes, H. O.},
     title = {On {Redfield's} {Range-Correspondences}},
     journal = {Canadian journal of mathematics},
     pages = {1060--1071},
     year = {1966},
     volume = {18},
     number = {1},
     doi = {10.4153/CJM-1966-105-5},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-105-5/}
}
TY  - JOUR
AU  - Foulkes, H. O.
TI  - On Redfield's Range-Correspondences
JO  - Canadian journal of mathematics
PY  - 1966
SP  - 1060
EP  - 1071
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-105-5/
DO  - 10.4153/CJM-1966-105-5
ID  - 10_4153_CJM_1966_105_5
ER  - 
%0 Journal Article
%A Foulkes, H. O.
%T On Redfield's Range-Correspondences
%J Canadian journal of mathematics
%D 1966
%P 1060-1071
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-105-5/
%R 10.4153/CJM-1966-105-5
%F 10_4153_CJM_1966_105_5

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

[2] 2. Hall, M. Jr., Theory oj groups (New York, 1959). Google Scholar

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

[4] 4. Littlewood, D. E., The theory of group characters and matrix representations of groups, 2nd ed. (Oxford, 1950). Google Scholar

[5] 5. Pólya, G., Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Math., 68 (1937), 145–254. Google Scholar

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

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

[8] 8. Riordan, J., An introduction to combinatorial analysis (New York, 1958). Google Scholar

[9] 9. Uhlenbeck, G. E. and Ford, G. W., Studies in statistical mechanics I, edited by De Boer and Uhlenbeck (Amsterdam, 1962), Part B. Google Scholar

Cité par Sources :