Applications of Polya’s theorem to distribution problems and partitions of integers
The number of ways to distribute r identical objects into n identical boxes can usually be obtained by a method of generating function or by a recursive formula. In this paper, for another approach, it is shown that we can obtain this number by using generalization of Polya’s theorem. From this, we...
Saved in:
| Main Author: | |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85024531130&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49257 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-49257 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-492572018-08-16T02:13:20Z Applications of Polya’s theorem to distribution problems and partitions of integers Vites Longani Mathematics The number of ways to distribute r identical objects into n identical boxes can usually be obtained by a method of generating function or by a recursive formula. In this paper, for another approach, it is shown that we can obtain this number by using generalization of Polya’s theorem. From this, we can also find the number of partitions of integer n as a sum of k positive integers. Computing for the results is discussed. © 2009 Taylor & Francis Group, LLC. 2018-08-16T02:13:20Z 2018-08-16T02:13:20Z 2009-01-01 Journal 09720529 2-s2.0-85024531130 10.1080/09720529.2009.10698218 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85024531130&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49257 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics Vites Longani Applications of Polya’s theorem to distribution problems and partitions of integers |
| description |
The number of ways to distribute r identical objects into n identical boxes can usually be obtained by a method of generating function or by a recursive formula. In this paper, for another approach, it is shown that we can obtain this number by using generalization of Polya’s theorem. From this, we can also find the number of partitions of integer n as a sum of k positive integers. Computing for the results is discussed. © 2009 Taylor & Francis Group, LLC. |
| format |
Journal |
| author |
Vites Longani |
| author_facet |
Vites Longani |
| author_sort |
Vites Longani |
| title |
Applications of Polya’s theorem to distribution problems and partitions of integers |
| title_short |
Applications of Polya’s theorem to distribution problems and partitions of integers |
| title_full |
Applications of Polya’s theorem to distribution problems and partitions of integers |
| title_fullStr |
Applications of Polya’s theorem to distribution problems and partitions of integers |
| title_full_unstemmed |
Applications of Polya’s theorem to distribution problems and partitions of integers |
| title_sort |
applications of polya’s theorem to distribution problems and partitions of integers |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85024531130&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49257 |
| _version_ |
1681423377443586048 |