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:
書目詳細資料
主要作者: Vites Longani
格式: 雜誌
出版: 2018
主題:
在線閱讀:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85024531130&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/49257
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
實物特徵
總結: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.