PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 31, 20241 citationsOpen Access

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

View Full Paper
CBCristina BallantineAWAmanda Welch

Key Points

Key points are not available for this paper at this time.

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 5 we have p₎₃^eu (n) <p₄₃^ou (n), where p₎₃^eu (n) is the number of partitions of n with odd parts distinct and even parts unrestricted and all odd parts less than all even parts and p₄₃^ou (n) is the number of partitions of n with even parts distinct and odd parts unrestricted and all even parts less than all odd parts. We also prove a conjectural inequality of Fu and Tang involving partitions with parts separated by parity with restrictions on the multiplicity of parts.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Ballantine et al. (2024) studied this question.

synapsesocial.com/papers/68e6775fb6db6435876016cbhttps://doi.org/10.48550/arxiv.2406.00139
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Combinatorial proof of a congruence for partitions into two sizes of part2026
  2. 2Combinatorial Proofs for Overpartitions and Two-Colored Partitions II2025
  3. 3Linear relations for the number of overpartitions into odd parts2024
  4. 4Overpartitions with parts separated by parity2025
  5. 5MacMahon's partition analysis XV: Parity2024 · 2 citations