Article ID Journal Published Year Pages File Type
5776944 Discrete Mathematics 2017 5 Pages PDF
Abstract
Recently, the number of partitions of the positive integer n that have exactly k distinct values for the parts has been expressed in terms of the number of partitions of n into exactly k distinct parts, q(n,k). In this paper, the authors considered some tools from symmetric functions theory and derived a recurrence relation for the number of partitions of the positive integer n that have exactly k distinct values for the parts. This recurrence relation does not involve other partition functions.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
,