Geodesic
An application of Pólya’s enumeration theorem to partitions of subsets of positive integers
Czechoslovak Mathematical Journal, Tome 55 (2005) no. 3, pp. 611-623
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ into $S$ is a finite nondecreasing sequence of positive integers $a_1, a_2, \dots , a_r$ in $S$ with repetitions allowed such that $\sum ^r_{i=1} a_i = n$. Here we apply Pólya’s enumeration theorem to find the number $¶(n;S)$ of partitions of $n$ into $S$, and the number ${\mathrm DP}(n;S)$ of distinct partitions of $n$ into $S$. We also present recursive formulas for computing $¶(n;S)$ and ${\mathrm DP}(n;S)$.
Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ into $S$ is a finite nondecreasing sequence of positive integers $a_1, a_2, \dots , a_r$ in $S$ with repetitions allowed such that $\sum ^r_{i=1} a_i = n$. Here we apply Pólya’s enumeration theorem to find the number $¶(n;S)$ of partitions of $n$ into $S$, and the number ${\mathrm DP}(n;S)$ of distinct partitions of $n$ into $S$. We also present recursive formulas for computing $¶(n;S)$ and ${\mathrm DP}(n;S)$.
Classification : 05A15, 05A17, 11P81
Keywords: Pólya’s enumeration theorem; partitions of a positive integer into a non-empty subset of positive integers; distinct partitions of a positive integer into a non-empty subset of positive integers; recursive formulas and algorithms 
@article{CMJ_2005_55_3_a3,
     author = {Wu, Xiaojun and Chao, Chong-Yun},
     title = {An application of {P\'olya{\textquoteright}s} enumeration theorem to partitions of subsets of positive integers},
     journal = {Czechoslovak Mathematical Journal},
     pages = {611--623},
     year = {2005},
     volume = {55},
     number = {3},
     mrnumber = {2153086},
     zbl = {1081.05010},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2005_55_3_a3/}
}
TY  - JOUR
AU  - Wu, Xiaojun
AU  - Chao, Chong-Yun
TI  - An application of Pólya’s enumeration theorem to partitions of subsets of positive integers
JO  - Czechoslovak Mathematical Journal
PY  - 2005
SP  - 611
EP  - 623
VL  - 55
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/CMJ_2005_55_3_a3/
LA  - en
ID  - CMJ_2005_55_3_a3
ER  - 
%0 Journal Article
%A Wu, Xiaojun
%A Chao, Chong-Yun
%T An application of Pólya’s enumeration theorem to partitions of subsets of positive integers
%J Czechoslovak Mathematical Journal
%D 2005
%P 611-623
%V 55
%N 3
%U http://geodesic.mathdoc.fr/item/CMJ_2005_55_3_a3/
%G en
%F CMJ_2005_55_3_a3
Wu, Xiaojun; Chao, Chong-Yun. An application of Pólya’s enumeration theorem to partitions of subsets of positive integers. Czechoslovak Mathematical Journal, Tome 55 (2005) no. 3, pp. 611-623. http://geodesic.mathdoc.fr/item/CMJ_2005_55_3_a3/

[1] G. E. Andrews: The Theory of Partitions. Addison-Wesley, Reading, 1976. | MR | Zbl

[2] N. G. De Bruijn: Pólya’s theory of counting. Appl. Combin. Math., E. F. Beckenbach (ed.), Wiley, New York, 1964, pp. 144–184. | Zbl

[3] P. Flajolet and M. Soria: Gaussian limiting distributions for the number of components in combinatorial structures. J.  Combin. Theory 53 (1990), 165–182. | DOI | MR

[4] F. Harary and E. M. Palmer: Graphical Enumeration. Academic Press, New York-London, 1973. | MR

[5] D. E. Knuth: A note on solid partitions. Math. Comp. 24 (1970), 955–961. | DOI | MR | Zbl

[6] G. Pólya: Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68 (1937), 145–254. | DOI

[7] G. Pólya and R. C. Read: Combinatorial Enumeration of Groups, Graphs and Chemical Compounds. Springer-Verlag, New York, 1987. | MR