New upper bounds for the number of partitions into a given number of parts
DOI10.1016/J.JNT.2014.03.015zbMATH Open1300.05035OpenAlexW2022791017MaRDI QIDQ403299FDOQ403299
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
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20) Elementary theory of partitions (11P81)
Cites Work
Cited In (9)
- Padovan numbers as sums over partitions into odd parts
- Simple upper bounds for partition functions
- Title not available (Why is that?)
- An explicit bound for the number of partitions into roots
- Inequalities involving the generating function for the number of partitions into odd parts
- On number of partitions of an integer into a fixed number of positive integers
- Proof of a conjecture of Mircea Merca
- Upper bounds for the rank of powers of quadrics
- Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) 👍 👎
- Some New Results on Partitions 👍 👎
- Title not available (Why is that?) 👍 👎
- A Bound for the Number of Multiplicative Partitions 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- New relations for the number of partitions with distinct even parts 👍 👎
- On a new formula for the number of unrestricted partitions 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: New upper bounds for the number of partitions into a given number of parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403299)
