Abstract
We study the number of ordered kpartitions of a multiset with equal sums, having elements \(\alpha _1,\ldots ,\alpha _n\) and multiplicities \(m_1,\ldots ,m_n\). Denoting this number by \(S_k(\alpha _1, \ldots , \alpha _n; m_1, \ldots , m_n)\), we find the generating function, derive an integral formula, and illustrate the results by numerical examples. The special case involving the set \(\{1,\dots ,n\}\) presents particular interest and leads to the new integer sequences \(S_k(n)\), \(Q_k(n)\), and \(R_k(n)\), for which we provide explicit formulae and combinatorial interpretations. Conjectures in connection to some superelliptic Diophantine equations and an asymptotic formula are also discussed. The results extend previous work concerning 2 and 3partitions of multisets.
Introduction
An integer partition is a way of writing an integer as a sum of natural numbers. The study of partitions was inaugurated through the pioneering work of Euler (1748), who introduced numerous concepts which are still in use, and proved fundamental results concerning partitions of an integer n into distinct parts, or into odd parts.
Since that time, numerous mathematicians including Gauss, Cauchy, Jacobi, Weierstrass, MacMahon, Hardy, Ramanujan, Erdös, and Andrews have contributed to the study of partitions. Key details about the history of partitions can be found in the classical books of Andrews [1] and [2], or in the review article by Pak [17], which focuses on bijective proofs of classical partitions identities.
First noticed by Euler, the number p(n) of ways in which a positive integer n can be partitioned as a sum of positive integers is given by the generating function:
For details about generating functions see [21]. The asymptotic estimation for p(n) was first given by Hardy and Ramanujan, who in 1918 proposed the formula:
valid as \({\displaystyle n\rightarrow \infty }\). An elementary proof was given in 1942 by Erdös [14].
Of particular interest is the study of partitions of the set \([n]=\{1,2,\ldots ,n\}\) into two sets with equal sums, which gives rise to the signum equation. For a positive integer n, the number of solutions is denoted by S(n) and corresponds to the number of ways in which one can choose \(+\) and − such that \(\pm 1\pm 2\pm 3\pm \cdots \pm n=0\). This sequence is indexed as A063865 [18] and was shown to be closely related to the ErdösSurányi problem, by Andrica and Ionaşcu [5]. The asymptotic formula for S(n) was conjectured in 2002 by Andrica and Tomescu [6]:
This was proved in 2013 by Sullivan [20], using analytic methods. Proof details and possible extensions based on the Central Limit Theorem, as well as connections to ErdösSurányi representations of integers, have been suggested [4, 5].
Another important and challenging problem is to enumerate the partitions of multisets having certain properties. Results for the number of partitions of multisets, as well as asymptotic formulae for small multiplicities were obtained in the 1970’s by Bender [12], and Bender et al. [13]. Further information about multiset theory can be found in the book by Stanley [19].
The current paper is motivated by initial results concerning the number of 2partitions with equal sums for multisets [11] and by the more recent extension to 3partitions with equal sums, in which different techniques were developed [7]. The framework for the general study of kpartitions with equal sums for multisets is inspired from the generating function approach proposed by Andrica in [3], which started initially from a problem involving derivatives. This opened the way to numerous novel results related to multipartitions with equal sums.
The structure of the paper is described below. In Sect. 2, we introduce the number \(S_k(\alpha _1, \ldots ,\alpha _n; m_1, \ldots , m_n)\), of ordered kpartitions of a multiset having equal sums, for which we obtain the generating function and an integral formula. The case of kpartitions of the set \([n]=\{1,\dots ,n\}\) is discussed in Sect. 3. The main results in Sect. 4 are contained in Theorems 1 and 2. This leads to the arithmetic functions \(S_k(n)\), \(Q_k(n)\), and \(R_k(n)\), for which we find explicit formulae, combinatorial interpretations, novel integer sequences, and conjectures related to superelliptic equations and to the asymptotic formula.
kPartitions of multisets with equal sums
One of the famous strongly NPcomplete problems is the 3partition problem, which has the following statement. Given the positive integers b, m and \(a_1,\dots ,a_n\) such that \(n = 3m\) and \(\sum _{s=1}^n a_s = mb\), one needs to partition the set \(\{a_1,\dots ,a_n\}\) into m subsets, each containing exactly three elements, in which sum is exactly b (see, e.g., [15] and [16]). For example, the set \(\{10, 13, 5, 15, 7, 10\}\) can be partitioned into the two sets \(\{ 10, 13, 7 \}\), \(\{5, 15, 10 \}\), each of which sum to 30.
In this paper, we investigate another kpartition concept of a multiset
where \(\alpha _1, \ldots , \alpha _n\) are integers and \(m_1, \dots ,m_n\) are positive integers. Each \(m_s\) is called the multiplicity of the element \(\alpha _s\), \(s=1,\dots ,n\), while \(\sigma (M)= \sum _{s=1}^n m_s\alpha _s\) represents the sum of the elements of M. For the sake of simplicity, we shall denote \(\varvec{\alpha } = (\alpha _1, \ldots , \alpha _n)\) and \(\mathbf{m} = (m_1, \ldots ,m_n)\).
Definition 1
Let \(k\ge 2\) be an integer. Denote by \(S_k(\varvec{\alpha };\mathbf{m})\) the number of ordered kpartitions of M having equal sums, i.e., the number of ktuples \((C_1,\dots , C_k)\) of pairwise disjoint subsets of M such that

(i)
\(C_1\cup \dots \cup C_k=M\);

(ii)
\(\sigma (C_1) =\dots =\sigma (C_k) =\frac{1}{k}\sigma (M)\).
Clearly, one has the relationship \( S_k(\varvec{\alpha };\mathbf{m})=k! \cdot N_k(\varvec{\alpha };\mathbf{m}), \) where \(N_k(\varvec{\alpha };\mathbf{m})\) is the number of nonordered kpartitions of M.
The number \(S_k(\varvec{\alpha };\mathbf{m})\) is the free (constant) term of the expansion of the Laurent polynomial \(F(X_1,\dots ,X_{k1})\in \mathbb {Z}[X_1,\dots ,X_{k1}, X_1^{1},\dots , X_{k1}^{1}]\), defined by
Indeed, assume that for \(s=1,\dots ,n\), from \(\left( X_1^{\alpha _s}+\cdots +X_{k1}^{\alpha _s} + \frac{1}{(X_1\cdots X_{k1})^{\alpha _s}}\right) ^{m_s}\) we have selected \(c^s_j\) terms equal to \(X_j^{\alpha _s}\), with \(j=1,\dots ,k1\), and \(c^s_k\) terms equal to \(\frac{1}{(X_1\cdots X_{k1})^{\alpha _s}}\). Notice that we must have \(c^s_1+\cdots +c^s_k=m_s\). Such a selection contributes to the free term if and only if
This is equivalent to
This means that the sets
represent a partition of M which also satisfies property (ii) in Definition 1.
Ordering (3) by the powers of \(X_j\), for \(j=1,\dots ,k1\), one obtains
where \(P_{m,j}(X_1,\dots ,X_{j1},X_{j+1},\dots ,X_{k1})\) are Laurent polynomials. As F is symmetric in its variables, the Laurent polynomials \(P_{m,j}\) do not actually depend on j; hence, we may use the simplified notation \(P_{m}(X_1,\dots ,X_{j1},X_{j+1},\dots ,X_{k1})\). One can easily check that the free term of \(F(X_1,\dots ,X_{k1})\) is equal to the free term of \(P_{0}(X_1,\dots ,X_{j1},X_{j+1},\dots ,X_{k1})\).
Denoting for simplicity \(\widetilde{X}_j=(X_1,\dots ,X_{j1},X_{j+1},\dots ,X_{k1})\), by (3), we have
Let \(X_j=\cos t+i\sin t\) in (3) and (5) and integrate with respect to t over the range \([0,2\pi ]\). Since the integral of the monomial \(X_j^m\) with respect to t over \([0,2\pi ]\) vanishes for \(m\ne 0\), the integral representation of the polynomial is given by
Setting \(X_j=X\), \(X_l=1\) for \(l=1,\dots ,k1\) and \(l\ne j\) in (3) and (5), one obtains
By symmetry in X and \(X^{1}\), we have
Also, from (6), we deduce that
which depends on k, \(\varvec{\alpha }\), and \(\mathbf {m}\). In what follows, we shall denote for simplicity \(P_{0}(1,\dots ,1)\) by \(Q_k(\varvec{\alpha };\mathbf{m})\). Since \(X^{\alpha _s}+ \frac{1}{X^{\alpha _s}} =2\cos \alpha _s t\), we have
We have that
where \(R_k(\mathbf {m};\varvec{\alpha })\) is the sum of the coefficients of \(P_{0}(\widetilde{X_j})\) that are different from the free term. Also, setting \(X=1\) in (7), we get \(k^{m_1+\cdots +m_n} = \sum _{m\in \mathbb {Z}} P_{m}(1\dots ,1)\), that is the sum of all the coefficients in all polynomials \(P_{m}\) is \(k^{m_1+\cdots +m_n}\).
By formula (9), after simple computations, it follows that
As shown in [11], the integral formula for the number of ordered 2partitions with equal sum, of the multiset M with integer elements \(\varvec{\alpha }\) and multiplicities \(\mathbf{m}\), is given by
For \(\alpha _s=s\) and \(m_1=\cdots =m_n=m\), \(s=1,\dots ,n\), this produces the formula:
where \(c^{(m)}_0(n)=S_2(1,2,\dots ,n; m,m,\dots ,m)\).
kPartitions with equal sums of the set \([n]=\{1,\dots ,n\}\)
In this section, we set \(\alpha _s=s\) and \(m_s=1\), for \(s=1,\dots ,n\), and use the simplified notations \(S_k(n)\) for \(S_k(\varvec{\alpha };\mathbf{m})\) and \(R_k(n)\) for \(R_k(\varvec{\alpha };\mathbf{m})\). Some recurrences can be obtained for the coefficients of the polynomial \(F(X_1,\dots ,X_{k1})\) defined by (3), which is indexed by the level n, as in the formula:
We may first write \(F_n(X_1,\dots ,X_{k1})\) as a Laurent polynomial in \(X_1,\dots ,X_{k1}\) with integer coefficients, given by the formula:
Clearly, we have
where U and V are polynomials. If \(V\ne 0\) at the origin of \(\mathbb R^{k1}\), then the coefficients in (14) are given by the Cauchy integral formula:
with T a product of sufficiently small circles around the coordinate axes of \(\mathbb R^{k1}\).
A detailed derivation of this approach, further applications and examples, can be found in [8, Chapter 4.3] and the references therein. While this is a closed formula, for effective computations, it is sometimes more practical to use a recurrence between the coefficients of levels n and \(n1\) (see Theorems 4 and 5 in [9]).
Setting \(X_1 = X\) and \(X_p=1\) for \(p=2,\dots ,k1\) in (13), one obtains
Notice that \(P_{n,m}(1,\dots ,1)=P_{n,m}(1,\dots ,1)\), \(m\in \mathbb Z\), which represents the sum of the coefficients of the Laurent polynomial \(P_{n,m}(X_1,\dots ,X_{k1})\). For simplicity, we denote \(P_{n,m}:=P_{n,m}(1,\dots ,1)\). The terms of the sequence \(\{P_{n,0}\}_{n\ge 1}\) can be obtained from the following double recurrence:
From the integral formula (9) applied in this case, we can also compute the terms \(P_{n,0}\) directly. Since this computation is actually performed for a given value of k, for what follows, we introduce the notation:
Simple calculations show that
and by (9) and (12) it follows that \(Q_2(n) = c^{(1)}_0(n)\).
Main results concerning \(Q_k(n)\)
In this section, we explore properties and special cases for \(Q_k(n)\), \(S_k(n)\), and \(R_k(n)\). In the process, we provide new context for a number of existing sequences and identify novel entries to [18]. We then establish a polynomial formula for \(Q_k(n)\) and conjecture its asymptotic behavior. We also conjecture properties related to the distribution of perfect powers within this sequence.
Denoting by T(n, k) the number of set partitions of \([n]=\{1,\dots ,n\}\) into k blocks with equal sum of elements, indexed as A275714 in [18], the number of ordered partitions satisfies \(S_k(n)=k!\cdot T(n,k)\) and generates a new sequence.
A combinatorial interpretation of \(Q_k(n)\)
In what follows we investigate the expression \(Q_k(n)\) defined by (18). In particular, \(Q_3(n)\) gives the number of solutions of the 3signum equation [7]
where \(\varepsilon _s \in \{1,0,1\}\), \(s=1,\dots ,n\). We study some properties of this sequence, and we illustrate a counting procedure for \(Q_k(n)\) when \(k=3\), \(k=4\), and \(k=5\).
The following result provides a new combinatorial context for \(Q_k(n)\).
Theorem 1
\(Q_k(n)\) is the number of ordered partitions of [n] into k disjoint sets \(A_1,\dots ,A_k\), with the property \(\sigma (A_1)=\sigma (A_k)\).
Proof
A monomial \(X_1^{d_1}\cdots X_{k1}^{d_{k1}}(X_1\cdots X_{k1})^{d_k}\) of \(F_n(X_1,\dots ,X_{k1})\) in (13) is independent of \(X_1\) if and only if \(d_1=d_k\). The number of such monomials equals the number the ordered partitions \(A_1, A_2, \dots , A_k\) of [n] such that \(\sigma (A_1)=\sigma (A_k)=d_1\), with \(d_j\ge 0\) for \(j=1,\dots ,k\) and \(d_1+\cdots +d_k=\sigma ([n])\). \(\square \)
Example 4
For \(k=3\), the sequence \(Q_3(n)\) starts with the terms
and is indexed as A007576. These terms can also obtained by formula (18) as
It was recently conjectured (see context for A007576 [18]) that
As the monomials in the expansion of \(F_n(X,Y)\) are of the form \(X^{\alpha }Y^{\beta }(XY)^{\gamma }\), a term is independent of X if and only if \(\alpha =\gamma \). To identify the numbers of terms independent of X, we need to count all subsets A and B of \(\{1,2,\dots ,n\}\) such that \(A\cap B=\emptyset \) with \(\sigma (A)=\sigma (B)=\alpha \) with \(\alpha ,\beta ,\gamma \ge 0\) and \(\alpha +\beta +\gamma =\sigma ([n])\). This is equivalent to finding the number of solutions of the 3signum equation (20). For \(k=3\), we list below the triples obtained for \(n=4\) and \(n=5\).
When \([n]=\{1,2,3,4\}\), we have \(\sigma ([n])=10\). We enumerate all the partitions A, B, C of [n] having the property \(\sigma (A)=\sigma (C)\). The problem is equivalent to finding all the triplets \((\alpha , \beta , \gamma )\) such that \(\alpha , \beta , \gamma \ge 0\), \(\alpha =\gamma \), and \(\alpha +\beta +\gamma =10\). Table 1 presents all such partitions and \(\varepsilon _s\), \(s=1,\dots ,4\), satisfying (20). Adding the multiplicities, we confirm that \(Q_3(4)=7\).
When \([n]=\{1,2,3,4,5\}\), we have \(\sigma ([n])=15\). We count the partitions A, B, C of [n] such that \(\sigma (A)=\sigma (C)\). To this end, we find the number of triplets \((\alpha , \beta , \gamma )\) such that \(\alpha , \beta , \gamma \ge 0\), \(\alpha =\gamma \), and \(\alpha +\beta +\gamma =15\). From simple computations, we obtain Table 2 presenting all possible subset configurations, along with the values for \(\varepsilon _s\), \(s=1,\dots ,5\) in (20). Adding the multiplicities, one obtains \(Q_3(5)=15\).
Example 5
For \(k=4\), the sequence \(Q_4(n)\) is indexed as A047653 and starts with
By (18), The integral formula for \(Q_4(n)\) is
and the asymptotic expansion was conjectured in 2014 (see A047653 in [18])
The sequence \(R_4(n)\) is novel and begins with the numbers
We now count the partitions A, B, C, D of \(\{1,2,3,4,5\}\) such that \(\sigma (A)=\sigma (D)\), that is the number of 4tuples \((\alpha , \beta , \gamma ,\delta )\) with the properties \(\alpha , \beta , \gamma ,\delta \ge 0\), \(\alpha =\delta \), and \(\alpha +\beta +\gamma +\delta =15\). Direct computations produce the values in Table 3.
One may notice that \(Q_4(5)=76=2^5+8\cdot 2^2+6\cdot 2\).
Remark 1
In Table 3, the \(B\cup C\) column contains all elements once. There are 8 instances where this contains two elements, and finally, 6 instances where this only has 1 single element.This suggests the formula:
This result will be fully explained in general, in the following subsection.
The polynomial formula for \(Q_k(n)\)
We show that \(Q_k(n)\) can be expanded as a polynomial in the variable \(k2\), and we calculate its coefficients. We prove that these are nonnegative integers for which we can establish a number of properties.
Theorem 2
\(1^{\circ }\) The following formula holds:
where for each \(d=0,\dots ,n\), N(d, n) is the number of ordered partitions of [n] into 3 subsets A, B, C, such that the cardinality of B is d and \(\sigma (A)=\sigma (C)\).
\(2^{\circ }\) The coefficients N(d, n) are given by the formula
where \(\sigma _d \left( \cos t,\cos 2t, \dots ,\cos nt\right) \) is the dth symmetric sum of \(\cos t,\cos 2t, \dots ,\cos nt\).
Proof
Recall that by formula (18), we have
hence, \(Q_k(n)\) is a monic polynomial of degree n in \(k2\).
\(1^{\circ }\) By Theorem 1, \(Q_k(n)\) represents the number of ordered partitions of [n] into k subsets \(A_1,\dots ,A_k\), with the property \(\sigma (A_1)=\sigma (A_k)\).
Consider a 3partition A, B, C of [n] such that \(\sigma (A)=\sigma (C)\) and assume that \(A\cup C\) has \(d=0,\dots ,n\) elements (denote the number of such 3partitions by N(d, n)). The number of ordered partitions of [n] into k subsets generated by this configuration, having the property \(A_1=A\), \(B = A_2\cup \dots \cup A_{k1}\), and \(A_k=C\) is \((k2)^{nd}\) (i.e., the number of functions between a set with \(nd\) elements and a set with \(k2\) elements). It is now clear that \(Q_k(n)\) is a linear combination of powers of \(k2\), where the coefficient of \((k2)^{nd}\) has the multiplicity N(d, n). This phenomenon is illustrated in Tables 1, 2, and 3.
\(2^{\circ }\) For \(d=0,\dots ,n\), the coefficients are
hence the result. \(\square \)
Corollary 1
Let \(N_{k_1,\dots ,k_d}\) be the number of solutions of the 2signum equation
(i.e., the number of ordered 2partitions with equal sums of the set \(\{k_1,\dots ,k_d\}\)).
The following relation holds true:
Proof
The following identity is known to hold (see, e.g., [4]):
where the sum is taken over all the choices of \(+\) and −.
Also, notice that for an integer \(k\in \mathbb Z\), one has
For fixed \(1\le k_1<k_2<\cdots <k_d\le n\), the integral of (25) gives \(N_{k_1,\dots ,k_d}\), by (27). Summing over all such configurations, we obtain (26). \(\square \)
We can now easily compute some particular coefficients.
Case \(d=0\). Clearly, one has \(N(0,n)=1\).
Case \(d=1\). For \(k_1=1,\dots ,n\), \(N_{k_1}=0\); hence, by Corollary 1, we have \(N(1,n)=0\).
Case \(d=2\). Whenever \(1\le k_1<k_2\le n\), we have \(N_{k_1,k_2}=0\); hence, \(N(2,n)=0\).
Case \(d=3\). By Corollary 1, we deduce that N(3, n) corresponds to the number of ordered triplets \((k_1,k_2,k_3)\) with the property \(1\le k_1<k_2<k_3\le n\) such that \(k_1+k_2=k_3\). This equals the number of pairs \((k_1,k_2)\) with \(1\le k_1<k_2<n\) such that \(k_1+k_2\le n\).
Clearly, if \(k_1=1\), then \(k_2\) takes the values \(2,\dots , n1\); If \(k_1=2\), then \(k_2\) takes the values \(3,\dots , n2\), and so on. Finally, if \(k_1=\left\lfloor \frac{n}{2} \right\rfloor \) then one has \(k_2=\left\lfloor \frac{n}{2} \right\rfloor +1\) for n odd, and there is no solution \(k_2\) for n even. This gives the expression
where the last formula is obtained by trying even and odd cases. One can notice that as a sequence of n, this recovers A007590.
Case \(d=n\). One obtains
Some results and conjectures concerning \(Q_k(n)\)
By (23), the coefficients of \(Q_k(n)\) are nonnegative integers, in which combinatorial meaning is related to the partitions of the set [n]. We shall present arithmetic properties of \(Q_k(n)\), highlight connections to hyperelliptic equations, and formulate conjectures related to elliptic curves and to the asymptotic behavior of \(Q_k(n)\).
Direct calculations involving the integral (18) lead to the formulae:
The sequence \(Q_k(3)\) recovers A034324 in [18], while the sequences \(Q_k(n)\) obtained for \(n=4,\dots , 9\) are new and have interesting arithmetic properties.
It has been claimed that the sequence \(Q_k(3)\) A084380 does not contain any perfect squares, i.e., the elliptic equation \(x^3+2 = y^2\) has no solution in positive integers. In [10, Theorem 2.3], Andrica and Ţurcas showed that in fact \((1,1)\) and \((1,1)\) are the only integer solutions of this equation.
This statement is linked to a Catalantype conjecture related to Pillai’s equation \(a^x  b^y = n\), with \(a>0, b>0, x>1, y>1\) integers, which states that for any integer n, there are finitely many perfect powers in which difference is n. For \(n=2\), the only solution involving perfect powers smaller than \(10^{18}\) was \(2 = 3^35^2\). The number of such solutions is linked to A076427 in [18].
Moreover, Andrica et al. in [9] proved that the only solutions to the equation \(x^5+8x^2+6x = y^4\) are \((x,y) = (0,0)\), \((1,1)\), and \((1,1)\) (Theorem 7), the only solutions for \(x^7+18x^4+30x^3+18x^2 + 12x + 8 = y^2\) are \((x,y) =(1,1)\), and \((1,1)\) (Theorem 8), and also discuss equations of the type \(y^{2m}=Q_{k}(2m+1)\).
We now formulate the following conjectures.
Conjecture 1
The sequence \(Q_k(4)\) does not contain any perfect cubes, i.e., the superelliptic equation \(x^4+4x+2 = y^3\) has no solution in positive integers.
On the other hand, it can be easily seen that the sequence \(Q_k(4)\) does not contain perfect squares, since for \(x\ge 3\), we have \((x^2)^2< x^4+4x+2 < (x^2+1)^2\).
Conjecture 2
The sequence \(Q_k(6)\) does not contain any perfect fifth powers, i.e., the superelliptic equation \(x^6+12x^3+16x^2+6x = y^5\) has no solution in nonnegative integers, apart from the trivial solution \(x=y=0\).
The sequence \(Q_k(6)\) does not contain perfect squares (hence, no perfect fourth powers), since for \(x\ge 5\), we have \((x^3+6)^2<x^6+12x^3+16x^2+6x <(x^3+7)^2\); also, the sequence \(Q_k(6)\) does not contain perfect cubes, as for \(x\ge 8\), we have \((x^2)^3<x^6+12x^3+16x^2+6x<(x^2+1)^3\). Simple computations show that the property holds for \(x=1,\dots ,4\) for squares, and for \(x=1,\dots ,7\) for cubes.
Conjecture 3
For \(2\le m\le n1\), the number of integer solutions to \(Q_k(n) = y^m\) is finite.
Conjectures 1, 2, and 3 have been checked for \(k\le 10^4\). The only perfect power encountered in the sequences \(Q_k(n)\) for \(n=4,5,6\), was found for \(n=5\) and \(k=8\), where \(Q_8(5) = 6^5+8\cdot 6^2 + 6 \cdot 6 = 8100=90^2\).
Conjecture 4
For \(k\ge 2\), the following asymptotic formula holds:
as \(n\rightarrow \infty \).
The formula for \(Q_2(n)\), conjectured by Andrica and Tomescu in 2002, was proved by Sullivan in 2013. This formula is also consistent with the asymptotic evaluations conjectured for \(Q_k(3)\) in Example 4, and for \(Q_k(4)\) in Example 5 (Fig. 1).
References
 1.
Andrews, G.E.: The Theory of Partitions. Cambridge University Press, Cambridge (1998)
 2.
Andrews, G.E., Eriksson, K.: Integer Partitions, 2nd edn. Cambridge University Press, Cambridge (2010)
 3.
Andrica, D.: A combinatorial result concerning the product of two or more derivatives. Bull. Calcutta Math. Soc. 92(4), 299–304 (2000)
 4.
Andrica, D., Ionaşcu, E.J.: Some unexpected connections between Analysis and Combinatorics. In: Rassias, T.M., Pardalos, P. (eds.) Mathematics Without Boundaries. Topics in Pure Mathematics, pp. 1–20. Springer, New York (2014)
 5.
Andrica, D., Ionaşcu, E.J.: The signum equation for Erdös–Surányi sequences. Integers 15A, 1–9 (2015)
 6.
Andrica, D., Tomescu, I.: On an integer sequence related to a product of trigonometric functions, and its combinatorial relevance. J. Integer Seq. 5, Article 02.2.4 (2002)
 7.
Andrica, D., Bagdasar O.: Some remarks on 3partitions of multisets. Proceedings of the 2nd IMA TCDM’18. Electron. Notes Discrete Math. 70, 1–8 (2018)
 8.
Andrica, D., Bagdasar, O.: Recurrent Sequences: Key Results. Applications and Problems. Springer, Berlin (2020)
 9.
Andrica, D., Bagdasar, O., Ţurcaş, G.C.: The number of partitions of a set and superelliptic Diophantine equations. In: Raigorodskii, A.M., Rassias, M.T. (eds.) Discrete Mathematics and Applications. Optimization and Its Applications, vol. 165, pp. 35–55. Springer, Cham (2020)
 10.
Andrica, D., Ţurcaş, G.C.: An elliptic Diophantine equation from the study of partitions. Stud. Univ. BabeşBolyai Math. 70(3), 349–356 (2019)
 11.
Bagdasar, O., Andrica, D.: New results and conjectures on 2partitions of multisets. Proceedings of the 7th ICMSAO’17, IEEE, pp. 1–5 (2017)
 12.
Bender, E.A.: Partitions of multisets. Discret. Math. 9, 301–311 (1974)
 13.
Bender, E.A., Devitt, J.S., Richmond, L.S.: Partitions of multisets II. Discret. Math. 50, 1–8 (1984)
 14.
Erdös, P.: On an elementary proof of some asymptotic formulas in the theory of partitions. Ann. Math. 43(2), 437–450 (1942)
 15.
Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4, 397–411 (1975)
 16.
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NPCompleteness. Freeman, San Francisco (1979)
 17.
Pak, I.: Partition bijections, a survey. Ramanujan J. 12, 5–75 (2006)
 18.
Sloane, N.J.A: The OnLine Encyclopedia of Integer Sequences. https://oeis.org
 19.
Stanley, R.P.: Weyl groups, the hard Lefschetz theorem and the Sperner property. SIAM J. Algebr. Discret. Methods 1, 168–184 (1980)
 20.
Sullivan, B.D.: On a conjecture of Andrica and Tomescu. J. Integer Seq. 16, Article 13.3.1 (2013)
 21.
Wilf, H.: Generatingfunctionology. Academic Press, New York (1994)
Acknowledgements
O. Bagdasar’s research was supported by a grant of the Romanian National Authority for Research and Innovation, CNCS/CCCDI UEFISCDI, project number PNIIIP22.1BG20160333, within PNCDI III.
Author information
Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
O. Bagdasar’s research was supported by a grant of the Romanian National Authority for Research and Innovation, CNCS/CCCDI UEFISCDI, project number PNIIIP22.1BG20160333, within PNCDI III.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Andrica, D., Bagdasar, O. On kpartitions of multisets with equal sums. Ramanujan J 55, 421–435 (2021). https://doi.org/10.1007/s11139021004187
Received:
Accepted:
Published:
Issue Date:
Keywords
 Multiset
 kPartition of a multiset
 Generating function
 Asymptotic formula
 3Signum equation
 Superelliptic Diophantine equation
Mathematics Subject Classification
 05A15
 05A16
 05A18
 11B75