On \(p\)-adic valuations of colored \(p\)-ary partitions (Q1712583): Difference between revisions

In partition theory, the sequence \(\big(A_{m,k}(n)\big)_{n\in\mathbb{N}}\), \(m\in\mathbb{N}_{\geq 2}\), \(k\in\mathbb{N_+}\), defined by \[\sum_{n=0}^\infty A_{m,k}(n) x^n = \prod_{n=0}^\infty \frac{1}{(1-x^{m^n})^k}\] can be interpreted in a natural combinatorial way. The term \(A_{m,k}(n)\) counts the number of representations of \(n\) as sums of powers of \(m\), where each summand has one among \(k\) colors. For a prime number \(p\), the \(p\)-adic valuation of an integer \(n\) is just the highest power of \(p\) dividing \(n\). In this paper, the authors investigate the \(p\)-adic valuation of the number \(A_{p,(p-1)(up^s-1)}(n)\) where \(p\) is an odd prime number, \(u\in\{1,2,\ldots,p-1\}\) and \(s\) is a positive integer.