Characterizing the number of coloured m-ary partitions modulo m, with and without gaps
classification
🧮 math.CO
keywords
gapsmodulopartitionswithoutcolourednumberandrewscase
read the original abstract
In a pair of recent papers, Andrews, Fraenkel and Sellers provide a complete characterization for the number of $m$-ary partitions modulo $m$, with and without gaps. In this paper we extend these results to the case of coloured $m$-ary partitions, with and without gaps. Our method of proof is different, giving explicit expansions for the generating functions modulo $m$
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.