Note on the number of ordered k-partitions of multiset M_d[n] with equal sums

If \(d\) and \(n\) are positive integers, then \(M_d[n] = \{d \cdot 1, d \cdot 2,\ldots,d \cdot n\}\) is a multiset of \(n\) types with repetition numbers \(d, d, \ldots , d\), respectively. Let \(Q_k^{d}(n)\) be the number of ordered \(k\)-partitions of \(M_d[n]\) into \(k\) disjoint sets \(A_1,\ldots,A_k\), with the property \(\sigma(A_1) = \sigma(A_k)\), where \(\sigma(S)\) is the sum of all element of the set \(S\). \textit{D. Andrica} and \textit{O. Bagdasar} [Electron. Notes Discrete Math. 70, 1--8 (2018; Zbl 1414.05036)] presented the following conjecture: for \(dn(n+1)\equiv 0\pmod 4\), \[Q_2^{(d)}(n)\sim \frac{2^{nd}}{n^{3/2}}\sqrt{\frac{6}{\pi d}}\] as \(n\to\infty\). Recently, \textit{D. Andrica} and \textit{O. Bagdasar} [Ramanujan J. 55, No. 2, 421--435 (2021; Zbl 1467.05010)] stated the following conjecture: for all \(k\geq 3\), \[Q_k^{(1)}(n) \sim \frac{k^{n+1/2}}{2n^{3/2}}\sqrt{\frac{3}{\pi}}\] as \(n\to\infty\). In this paper, the authors generalize and prove the above conjectures.

Recommendations

Cites work

Cited in

(1)

On \(k\)-partitions of multisets with equal sums

This page was built for publication: Note on the number of ordered \(k\)-partitions of multiset \(M_d[n]\) with equal sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159757)