New upper bounds for the number of partitions into a given number of parts

DOI10.1016/j.jnt.2014.03.015zbMath1300.05035OpenAlexW2022791017MaRDI QIDQ403299

Mircea Merca

Publication date: 29 August 2014

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

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

zbMATH Keywords

integer partitionsmultinomial coefficientsbinomial coefficients

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Elementary theory of partitions (11P81)

Related Items (5)

Padovan numbers as sums over partitions into odd parts ⋮ Unnamed Item ⋮ Proof of a conjecture of Mircea Merca ⋮ On number of partitions of an integer into a fixed number of positive integers ⋮ Inequalities involving the generating function for the number of partitions into odd parts

Cites Work

• The Number of Partitions of the Integer N into M Nonzero Positive Integers
• Unnamed Item

This page was built for publication: New upper bounds for the number of partitions into a given number of parts