On Andrews' partitions with parts separated by parity
classification
🧮 math.NT
keywords
andrewsparitypartitionspartsseparatedannalsbijectivecombinatorics
read the original abstract
In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations of related partition functions are studied resulting in a number of interesting identities.
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.