Characterizing the number of coloured m-ary partitions modulo m, with and without gaps
From MaRDI portal
(Redirected from Publication:1709511)
Characterizing the number of coloured \(m\)-ary partitions modulo \(m\), with and without gaps
Characterizing the number of coloured \(m\)-ary partitions modulo \(m\), with and without gaps
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
Recommendations
- \(m\)-ary partitions with no gaps: a characterization modulo \(m\)
- On the enumeration and congruences for \(m\)-ary partitions
- Characterizing the number of \(m\)-ary partitions modulo \(m\)
- The distribution of the number of parts of \(m\)-ary partitions modulo \(m\)
- A note on the restricted partition function \(p_{\mathcal{a}}(n, k)\)
Cites work
- scientific article; zbMATH DE number 3289585 (Why is no real title available?)
- scientific article; zbMATH DE number 3327321 (Why is no real title available?)
- Characterizing the number of \(m\)-ary partitions modulo \(m\)
- Congruence properties of the \(m\)-ary partition function
- Curing the andrews syndrome
- The distribution of the number of parts of \(m\)-ary partitions modulo \(m\)
- Unique path partitions: characterization and congruences
- \(m\)-ary partitions with no gaps: a characterization modulo \(m\)
This page was built for publication: Characterizing the number of coloured \(m\)-ary partitions modulo \(m\), with and without gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709511)