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: | Vites Longani |
---|---|
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 |
Similar Items
-
Applications of Polya’s theorem to distribution problems and partitions of integers
by: Vites Longani
Published: (2018) -
An algorithm for partitioning an integer n as a sum of k positive integers
by: Vites Longani
Published: (2018) -
Applications of student activity problems for some kirkman type problems
by: Vites Longani, et al.
Published: (2018) -
A Kruskal-Katona type theorem for integer partitions
by: Ku, C.Y., et al.
Published: (2014) -
On the ranks of partitions modulo certain integers
by: Hong, Nankun
Published: (2020)