Parity biases in partitions and restricted partitions
From MaRDI portal
Publication:2136205
DOI10.1016/J.EJC.2022.103522zbMATH Open1497.11252arXiv2111.10590OpenAlexW3215885731MaRDI QIDQ2136205FDOQ2136205
Authors: Koustav Banerjee, Sreerupa Bhattacharjee, Pankaj Jyoti Mahanta, Manjil Pratim Saikia, Manosij Ghosh Dastidar
Publication date: 10 May 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: Let (resp. ) denote the number of partitions of with more odd parts (resp. even parts) than even parts (resp. odd parts). Recently, Kim, Kim, and Lovejoy proved that for all and conjectured that for all where (resp. ) denote the number of partitions into distinct parts having more odd parts (resp. even parts) than even parts (resp. odd parts). In this paper we provide combinatorial proofs for both the result and the conjecture of Kim, Kim and Lovejoy. In addition, we show that if we restrict the smallest part of the partition to be , then the parity bias is reversed. That is, if (resp. ) denote the number of partitions of with more odd parts (resp. even parts) than even parts (resp. odd parts) where the smallest part is at least , then we have for all . We also look at some more parity biases in partitions with restricted parts.
Full work available at URL: https://arxiv.org/abs/2111.10590
Recommendations
Cites Work
- Differences of Partition Functions: The Anti-telescoping Method
- Some inequalities for \(k\)-colored partition functions
- The nonexistence of certain identities in the theory of partitions and compositions
- Some elementary partition inequalities and their implications
- Refinements of some partition inequalities
- Parity bias in partitions
- BIASES IN INTEGER PARTITIONS
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- Berkovich-Uncu type partition inequalities concerning impermissible sets and perfect power frequencies
- Parity biases in partitions and restricted partitions
- Asymptotics of parity biases for partitions into distinct parts via Nahm sums
- Refined parity biases in integer partitions
- Parity bias for the partitions with bounded number of appearances of the part of size 1
This page was built for publication: Parity biases in partitions and restricted partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136205)