Combinatorial proof of an identity of Andrews and Yee
Abstract
Recently, Andrews and Yee studied two-variable generalizations of two identities involving partition functions pω(n) and p(n) introduced by Andrews, Dixit and Yee. In this paper, we present a combinatorial proof of an interesting identity in their work.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.