Combinatorial proofs of inequalities involving the number of partitions with parts separated by parity

Cristina Ballantine, Amanda Welch

Research output: Working paperPreprint

Abstract

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)
Original languageUndefined/Unknown
StatePublished - May 31 2024

Keywords

  • math.CO
  • math.NT
  • 05A17, 05A20, 11P81

Cite this