Characterizing the number of coloured $m$-ary partitions modulo $m$, with and without gaps
Combinatorics
2017-01-26 v1
Abstract
In a pair of recent papers, Andrews, Fraenkel and Sellers provide a complete characterization for the number of -ary partitions modulo , with and without gaps. In this paper we extend these results to the case of coloured -ary partitions, with and without gaps. Our method of proof is different, giving explicit expansions for the generating functions modulo
Keywords
Cite
@article{arxiv.1701.07077,
title = {Characterizing the number of coloured $m$-ary partitions modulo $m$, with and without gaps},
author = {I. P. Goulden and Pavel Shuldiner},
journal= {arXiv preprint arXiv:1701.07077},
year = {2017}
}
Comments
5 pages