On number of partitions of an integer into a fixed number of positive integers

DOI10.1016/j.jnt.2015.06.023zbMath1341.11057OpenAlexW844336330MaRDI QIDQ746947

A. Yavuz Oruç

Publication date: 21 October 2015

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2015.06.023

zbMATH Keywords

upper boundspartition of an integerHardy-Ramanujan-Rademacher asymptotic formulapartition of an integer into a fixed number of parts

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Analytic theory of partitions (11P82)

Related Items (5)

Duality of averaging of quantum states over arbitrary symmetry groups revealing Schur–Weyl duality ⋮ On the number of fair dominating sets of graphs ⋮ Monochromatic strictly ascending waves and permutation pattern waves ⋮ Unnamed Item ⋮ On the \(\sigma_t\)-irregularity and the inverse irregularity problem

Cites Work

• Unnamed Item
• Unnamed Item
• New upper bounds for the number of partitions into a given number of parts
• An elementary derivation of the asymptotics of partition functions
• The Number of Partitions of the Integer N into M Nonzero Positive Integers
• AN ASYMPTOTIC FORMULA IN THE THEORY OF PARTITIONS

This page was built for publication: On number of partitions of an integer into a fixed number of positive integers