Combinatorial proof of an identity of Andrews and Yee
classification
🧮 math.CO
keywords
andrewscombinatorialidentityproofdixitfunctionsgeneralizationsidentities
read the original abstract
Recently, Andrews and Yee studied two-variable generalizations of two identities involving partition functions $p_\omega(n)$ and $p_\nu(n)$ introduced by Andrews, Dixit and Yee. In this paper, we present a combinatorial proof of an interesting identity in their work.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.