Geodesic
A Theorem for Enumerating Certain Types of Collections
Canadian journal of mathematics, Tome 25 (1973) no. 1, pp. 74-82

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

In this paper, we are concerned with proving a formula for the computation of what is variously called the pattern inventory (e.g., see De Bruijn [2]) or the configuration counting series (e.g., see Harary [3]). Rather than redeveloping a large number of definitions, we shall assume the reader is already familiar with the terminology used by De Bruijn [2].Polya, in a celebrated paper [4], proved a formula for computing the pattern inventory for all functions f defined on a set D (where D is acted on by a permutation group G), and mapping into a set R (which is called the store) for which the “store enumerator” in known. 
Osterweil, Leon. A Theorem for Enumerating Certain Types of Collections. Canadian journal of mathematics, Tome 25 (1973) no. 1, pp. 74-82. doi: 10.4153/CJM-1973-005-8
@article{10_4153_CJM_1973_005_8,
     author = {Osterweil, Leon},
     title = {A {Theorem} for {Enumerating} {Certain} {Types} of {Collections}},
     journal = {Canadian journal of mathematics},
     pages = {74--82},
     year = {1973},
     volume = {25},
     number = {1},
     doi = {10.4153/CJM-1973-005-8},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-005-8/}
}
TY  - JOUR
AU  - Osterweil, Leon
TI  - A Theorem for Enumerating Certain Types of Collections
JO  - Canadian journal of mathematics
PY  - 1973
SP  - 74
EP  - 82
VL  - 25
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-005-8/
DO  - 10.4153/CJM-1973-005-8
ID  - 10_4153_CJM_1973_005_8
ER  - 
%0 Journal Article
%A Osterweil, Leon
%T A Theorem for Enumerating Certain Types of Collections
%J Canadian journal of mathematics
%D 1973
%P 74-82
%V 25
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-005-8/
%R 10.4153/CJM-1973-005-8
%F 10_4153_CJM_1973_005_8

[1] 1. Bruijn, N. G. De, Generalization of Poly a's fundamental theorem in enumeration combinatorial analysis, Indag. Math. 21 (1959), 59–69. Google Scholar

[2] 2. Bruijn, N. G. De, Polyd's theory of counting, Applied combinatorial mathematics, Beckenbach, E. J., ed. (John Wiley and Sons, New York, 1964). Google Scholar

[3] 3. Harary, F., Graph theory (Addison Wesley, Reading, 1969). Google Scholar

[4] 4. Polya, G., KombinatorischeAnzahlbestimmungen fur Gruppen, Graphen und Chemische Verbindungen, Acta Math. 68 (1937), 145–254. Google Scholar

[5] 5. Riordan, J., An introduction to combinatorial analysis (John Wiley and Sons, New York, 1958). Google Scholar

Cité par Sources :