On partitions classified by smallest missing part
From MaRDI portal
Publication:2422147
In this paper, the author investigates the following inequality related to the parity of the smallest missing part of partitions: the number of partitions of \(n\) in which the smallest missing part is odd is always larger than or equal to the number of partitions of \(n\) in which the smallest missing part is even except the case when \(n=1\).
Recommendations
Cites work
- An analog of crank for a certain kind of partition function arising from the cubic continued fraction
- Concave compositions
- Dyson’s crank of a partition
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- RAMANUJAN'S CUBIC CONTINUED FRACTION AND AN ANALOG OF HIS "MOST BEAUTIFUL IDENTITY"
- Ramanujan's cubic continued fraction and Ramanujan type congruences for a certain partition function
Cited in
(8)- On conjectures concerning the smallest part and missing parts of integer partitions
- Some elementary partition inequalities and their implications
- Dyson's crank and the mex of integer partitions
- Turning the Partition Crank
- On partitions without small parts
- Two partition inequalities related to the minimal excludant
- On Blecher and Knopfmacher's fixed points for integer partitions
- The minimal excludant of bipartitions
This page was built for publication: On partitions classified by smallest missing part
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422147)