Characterizing the number of coloured m-ary partitions modulo m, with and without gaps
From MaRDI portal
Publication:1709511
DOI10.1016/J.DISC.2018.01.017zbMATH Open1383.05022arXiv1701.07077OpenAlexW2581995822MaRDI QIDQ1709511FDOQ1709511
Authors: Pavel Shuldiner, I. P. Goulden 
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
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
Full work available at URL: https://arxiv.org/abs/1701.07077
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)\)
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)
Cites Work
- Congruence properties of the \(m\)-ary partition function
- Title not available (Why is that?)
- Title not available (Why is that?)
- The distribution of the number of parts of \(m\)-ary partitions modulo \(m\)
- Unique path partitions: characterization and congruences
- Characterizing the Number of <em>m</em>-ary Partitions Modulo <em>m</em>
- \(m\)-ary partitions with no gaps: a characterization modulo \(m\)
- Curing the andrews syndrome
Cited In (1)
Uses Software
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)
