Two partition inequalities related to the minimal excludant
From MaRDI portal
(Redirected from Publication:6139317)
In this article, the authors prove \(l(n,m)=e(n,m)\) analytically and combinatorially; and \(s_{e}(n)>s_{o}(n)\) combinatorially. Further, they establish relations for all \(n>0\), \(l_{e}(2n)=p_{2,1}(2n)\), \(l_{e}(2n+1)=\overline{p}_{2,1}(2n+1)\); \(l_{o}(2n)=\overline{p}_{2,1}(2n)\), \(l_{o}(2n+1)=p_{2,1}(2n+1)\) and \(l_{e}(n)=p_{4,2}(n)\), \(l_{o}(n)=\overline{p}_{4,2}(n)\).
Recommendations
Cites work
- Analysis of some new partition statistics
- Combinatorial perspectives on the crank and mex partition statistics
- Combinatorial proof of a theorem on partitions into an even or odd number of parts
- Dyson's crank and the mex of integer partitions
- Dyson’s crank of a partition
- scientific article; zbMATH DE number 2126631 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- On partitions classified by smallest missing part
- Partitions and the minimal excludant
- The minimal excludant in integer partitions
- Turning the Partition Crank
Cited in
(3)
This page was built for publication: Two partition inequalities related to the minimal excludant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139317)
