Show simple item record

On Number Of Partitions Of An Integer Into A Fixed Number Of Positive Integers

dc.contributor.authorOruc, A. Yavuz
dc.date.accessioned2015-05-27T12:20:44Z
dc.date.available2015-05-27T12:20:44Z
dc.date.issued2015-04
dc.identifierhttps://doi.org/10.13016/M2J62F
dc.identifier.urihttp://hdl.handle.net/1903/16351
dc.descriptionSubmitted to Journal of Number Theory.en_US
dc.description.abstractThis paper focuses on the number of partitions of a positive integer $n$ into $k$ positive summands, where $k$ is an integer between $1$ and $n$. Recently some upper bounds were reported for this number in [Merca14]. Here, it is shown that these bounds are not as tight as an earlier upper bound proved in [Andrews76-1] for $k\le 0.42n$. A new upper bound for the number of partitions of $n$ into $k$ summands is given, and shown to be tighter than the upper bound in [Merca14] when $k$ is between $O(\frac{\sqrt{n}}{\ln n})$ and $n-O(\frac{\sqrt{n}}{\ln n})$. It is further shown that the new upper bound is also tighter than two other upper bounds previously reported in~[Andrews76-1] and [Colman82]. A generalization of this upper bound to number of partitions of $n$ into at most $k$ summands is also presented.en_US
dc.subjectPartition theoryen_US
dc.subjectRestricted partitionsen_US
dc.subjectUpper bounden_US
dc.titleOn Number Of Partitions Of An Integer Into A Fixed Number Of Positive Integersen_US
dc.typeOtheren_US
dc.relation.isAvailableAtA. James Clark School of Engineeringen_us
dc.relation.isAvailableAtElectrical & Computer Engineeringen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record