High order congruences for \(M\)-ary partitions (Q6607832)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: High order congruences for M-ary partitions |
scientific article; zbMATH DE number 7915711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High order congruences for \(M\)-ary partitions |
scientific article; zbMATH DE number 7915711 |
Statements
High order congruences for \(M\)-ary partitions (English)
0 references
19 September 2024
0 references
Let \(M = \{m_i\}_{i=0}^{\infty}\) be a (possibly finite) sequence of integers, \(m_0 = 1, m_i \ge 2\) for \(i \ge 1\), and for \(r \ge 0\) let \(M_r := m_0\cdots m_r\). Then an \(M\)-ary partition of a positive integer \(n\) is an expression of the form \(n = M_{r_1}+\cdots +M_{r_s}\) for some nonnegative integers \(r_1,\cdots,r_s\). The number of \(M\)-ary partitions of \(n\) is denoted \(p_M(n)\).\par The main result is Theorem 1.3 asserting that for all positive integers \(n\) and \(r\) \[p_M(m_1m_2\cdots m_r n-1) \equiv 0 \bmod \prod_{l=2}^{r}\mathcal{M}(m_l,l-1),\] where \[\mathcal{M}(m,r)=\frac{m}{\mathrm{gcd} (m, \mathrm{lcm} (1,\cdots,r))}.\] For the proof the generating function \[\sum_{n=0}^{\infty}p_M(n)q^n =\prod_{r=0}^{\infty}\frac{1}{1-q^{M_r}}\] and the linear operator \(U_m: \mathbb{Z}[[q]]\to \mathbb{Z}[[q]] \); \[U_m\sum_{n=0}^{\infty}a(n)q^n =\sum_{n=0}^{\infty}a(nm)q^n \] are used with ingenious technique.
0 references
\(M\)-ary partitions
0 references
congruences
0 references
generating functions
0 references
0.8808481693267822
0 references
0.8766883611679077
0 references
0.8737411499023438
0 references
0.8515396118164062
0 references
0.844863772392273
0 references