# An explicit form of the polynomial part of a restricted partition function

- Karl Dilcher
^{1}and - Christophe Vignat
^{2, 3}Email author

**3**:1

**DOI: **10.1007/s40993-016-0065-3

© The Author(s) 2017

**Received: **31 August 2016

**Accepted: **17 November 2016

**Published: **5 January 2017

## Abstract

We prove an explicit formula for the polynomial part of a restricted partition function, also known as the first Sylvester wave. This is achieved by way of some identities for higher-order Bernoulli polynomials, one of which is analogous to Raabe’s well-known multiplication formula for the ordinary Bernoulli polynomials. As a consequence of our main result we obtain an asymptotic expression of the first Sylvester wave as the coefficients of the restricted partition grow arbitrarily large.

### Keywords

Restricted partitions Sylvester waves Bernoulli polynomials Raabe’s identity### Mathematical Subject Classification

Primary 11P81 Secondary 11B68## 1 Background

*restricted partitions*, where the following question has been studied quite extensively: given a vector \(\mathbf{d }:=(d_1,d_2,\ldots ,d_m)\) of positive integers, let \(W(s,\mathbf{d })\) be the number of partitions of the integer

*s*with parts in \(\mathbf{d }\), i.e., \(W(s,\mathbf{d })\) is the number of solutions of

*j*of the components of \({\mathbf{d }}\). Sylvester [23] showed that for each such

*j*, \(W_j(s,{\mathbf{d }})\) is the coefficient of \(t^{-1}\), i.e., the residue, of the function

*j*th root of unity, for instance \(\rho _j=e^{2\pi i/j}\), and where we set \(\gcd (0,0)=1\) by convention. In other words, the sum in (4) is taken over all primitive

*j*th roots of unity \(\rho _j^{\nu }\). These

*Sylvester waves*have been studied in great detail in recent years; see, e.g., [10, 19, 20]; see also [7, 8, 14] for a broader perspective, and [21] for computations related to restricted partitions.

For \(j=1\), the right-hand side of (4) is recognizable as being very close to the generating function of a higher-order Bernoulli polynomial. This fact was used by Rubinstein and Fel [20] to write \(W_1(s,{\mathbf{d }})\) in a very compact form in terms of a single higher-order Bernoulli polynomial [see (33) below]. A version of this result, given in two different forms, was earlier obtained by Beck, Gessel and Komatsu [3], as mentioned in [20]. Similarly, for \(j=2\) we have \(\rho _j=-1\), and the right-hand side of (4) will typically lead to a convolution sum of higher-order Bernoulli and higher-order Euler polynomials; this was also done in [20]. Furthermore, Rubinstein and Fel extended this approach and expressed \(W_j(s,{\mathbf{d }})\) for arbitrary *j* in terms of generalized Eulerian polynomials of higher order, in addition to the expected higher-order Bernoulli polynomials.

In a subsequent paper, Rubinstein [19] showed that all the Sylvester waves \(W_j(s,{\mathbf{d }})\) can be written as linear combinations of the first wave (\(j=1\)) alone, with modified integers *s* and vectors \({\mathbf{d }}\) [see (47) below]. This makes it worthwhile to give further consideration to \(W_1(s,{\mathbf{d }})\), which is the purpose of the present paper. Our main result is the following explicit formula for \(W_1(s,{\mathbf{d }})\); its significance lies in the fact that it does not contain Bernoulli numbers or polynomials.

### Theorem 1.1

For a more compact form of this identity, see Sect. 5.

Towards proving this theorem, we derive (or re-derive) some identities which are analogous to classical results in the theory of Bernoulli polynomials and their higher-order analogues. Our main tool is a symbolic notation which, in spite of some similarities, is different from the classical umbral calculus. This will be introduced in Sect. 2, and we apply it in Sect. 3 to prove the auxiliary results as well as Theorem 1.1. In Sect. 4 we present some examples and consequences of Theorem 1.1, including an asymptotic expression. We finish this paper with some additional remarks in Sect. 5.

## 2 Symbolic notation

Although the results in Sect. 3 could also be proved (and in some cases have been proved) by other methods, especially using generating functions, the symbolic notation described below makes the discovery and proof of some identities considerably easier. While there are similarities to the classical umbral calculus (see, e.g., [11] or [18]), our notation is more specific to Bernoulli numbers and polynomials, and is related to probability theory. The following brief exposition is partly taken from [6]; we repeat it here for the sake of completeness.

*Bernoulli symbol*\({\mathcal {B}}\) by

*n*th Bernoulli number. So, for instance, we can be rewrite the usual definition for the Bernoulli polynomial \(B_n(x)\),

*uniform symbol*\({\mathcal {U}}\) is defined by

*f*is an arbitrary polynomial. From (11) we immediately obtain, in analogy to (6),

*f*.

*discrete uniform symbol*\({\mathcal {U}}_{\{a_1,\ldots ,a_m\}}\) by way of the generating function

*f*, which can be seen as a discrete analogue of (11). From the definition (15) we immediately obtain the identity

*higher-order Bernoulli symbol*\({\mathcal {B}}^{(k)}\) by

## 3 Higher-order Bernoulli polynomials and proof of Theorem 1.1

*Bernoulli polynomial of order*

*k*is defined by the generating function

### Theorem 3.1

*n*,

*m*, and \(d_1,\ldots ,d_m\) be positive integers, and set \(d:=d_1\ldots d_m\). Then

### Proof

*m*by \(\widetilde{d}_i\), we get

*m*, (26) leads to (24), and we are done. \(\square \)

We note that this result is not new. In fact, it is a special case of identity (60) in the classical book of Nörlund [13, p. 135]. However, the method of proof in [13] is very different from ours and relies on the theory of finite differences. On the other hand, it should also be mentioned that the symbolic notation involving the Bernoulli symbol, more or less as used on the left-hand side of (24), can also be found in [13], on p. 135 and elsewhere.

*Bernoulli-Barnes polynomials*.

From (24) and (28) we can now obtain the following analogue of (28).

### Corollary 3.2

Before proving this, we note that in the case \(d_1=\cdots =d_m=1\), the multiple sum on the right of (31) collapses to the single term \(\ell _1=\dots =\ell _m=0\), and (31) reduces to (28).

### Proof of Corollary 3.2

*d*, we obtain (31). \(\square \)

For the proof of Theorem 1.1 we also need the following reflection formula, which can be found in [13, p. 134]. For the sake of completeness we will provide a proof.

### Lemma 3.3

*m*and \(d_1,\ldots ,d_m\) be positive integers, and let \({\mathbf{d }}:=(d_1,\ldots ,d_m)\) and \(\sigma :=d_1+\cdots +d_m\). Then for all \(n\ge 0\) we have

### Proof

## 4 Examples and consequences of Theorem 1.1

Theorem 1.1 can also be used to determine the two highest coefficients of \(W_1(s,{\mathbf{d }})\); we state this as a corollary.

### Corollary 4.1

The leading coefficient, which has long been known (see, e.g., [3] and references therein), follows immediately from (5) if we note that by (27) the number of summands in the *m*-fold sum is \(d^{m-1}\). The second coefficient follows from a simple expansion of the product on the right of (5). We skip the details since both coefficients follow immediately from the identity (3) in [3].

For the special case \({\mathbf{d }}=(1,2,\ldots ,m)\), the identity (40) can be found in [17, Satz 1] and [24, p. 311].

From the fact that the first Sylvester wave is a polynomial, it is clear that for fixed *m* and bounded components of \({\mathbf{d }}\), \(W_1(s,{\mathbf{d }})\) is asymptotically equal to the leading term in (40), as *s* gets arbitrarily large. However, it is not immediately clear what happens if the components of \({\mathbf{d }}\) also grow, along with *s*. This is addressed in the following consequence of Theorem 1.1.

### Corollary 4.2

*d*grow arbitrarily large in such a way that at least two of the components \(d_j\), \(1\le j\le m\), are unbounded. Then

*d*.

The proof of this result relies on interpreting the *m*-fold sum on the right of (5) as a Riemann sum of a certain multiple integral. We therefore begin by evaluating this integral.

### Lemma 4.3

### Proof

*m*-fold) use of the cancellation property (14). \(\square \)

### Proof of Corollary 4.2

*d*grows, then \(\Delta x_1=1/(d_2\ldots d_m)\) would not approach 0 as

*d*grows. However, this cannot happen if at least two of the \(d_j\) are unbounded as

*d*grows. If we now multiply the sum on the right of (43) by

*m*-fold sum as a Riemann sum that converges to the integral in (42). Hence we have, by Lemma 4.3,

*s*/

*d*. \(\square \)

## 5 Additional Remarks

1. If we divide each factor in the product on the right of (5) by *d*, we see that the resulting product can be written as a Pochhammer symbol (rising factorial) or as a falling factorial. But we can also combine it with \((m-1)!\) in the denominator; using the (generalized) binomial coefficient \(\left( {\begin{array}{c}x\\ n\end{array}}\right) =x(x-1)\ldots (x-n+1)/n!\) we can then rewrite Theorem 1.1 as follows.

### Corollary 5.1

The binomial coefficient on the right of (44) is reminiscent of some combinatorial objects related to partitions and compositions. (Note, however, that \((s-\ell )/d\) is generally not an integer).

While this is not the same as the number of compositions of *s* into *m* parts, there is a connection: The number of compositions of *n* into exactly *m* parts, each at least *k*, is \(\left( {\begin{array}{c}m-1+n-km\\ m-1\end{array}}\right) \); see [1, p. 63].

2. For the sake of completeness we cite the main result of Rubinstein [19], which we referred to in the Introduction. While for \(W_1(s,{\mathbf{d }})\) the order of the components in the given vector \({\mathbf{s }}=(d_1,\ldots ,d_m)\) is irrelevant, this becomes an issue for the Sylvester waves \(W_j(s,{\mathbf{d }})\) when \(j\ge 2\).

*j*divides the first \(k_j\) components. We denote

*j*.

*prime radical circulator*\(\psi _j(s)\), which for positive integers

*s*is defined by

*j*th root of unity. For prime

*j*we have

*j*; see [19] and the references therein for further details.

### Example 1

If *j* does not divide any of the components of \({\mathbf{d }}\), then \(k_j=m\), and \(W_j(s,{\mathbf{d }}) = 0\) as the sum on the right of (47) is empty. This is consistent with (3) and the statement following it.

### Example 2

## Declarations

### Author's contributions

Both authors read and approved the final manuscript.

### Open Access

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

### Acknowledgements

The first author was supported in part by the Natural Sciences and Engineering Research Council of Canada.

Dedicated to the memory of our friend and colleague Jonathan M. Borwein, mathematician extraordinaire.

### Competing interests

The authors declare that they have no competing interests.

## Authors’ Affiliations

## References

- Andrews, G.E.: The theory of partitions. Addison-Wesley, Reading (1976)MATHGoogle Scholar
- Bayad, A., Beck, M.: Relations for Bernoulli–Barnes numbers and Barnes zeta functions. Int. J. Number Theory
**10**(5), 1321–1335 (2014)MathSciNetView ArticleMATHGoogle Scholar - Beck, M., Gessel, I.M., Komatsu, T.: The polynomial part of a restricted partition function related to the Frobenius problem. Electron. J. Combin. 8(1), Note 7 (2001)Google Scholar
- Beck, M., Robins, S.: Computing the continuous discretely. Integer-point enumeration in polyhedra, 2nd edn. Springer, New York (2015)Google Scholar
- Dickson, L.E.: History of the Theory of Numbers. Volume II: Diophantine Analysis. The Carnegie Institute, Washington, D.C. (1919)MATHGoogle Scholar
- Dilcher, K., Vignat, C.: General convolution identities for Bernoulli and Euler polynomials. J. Math. Anal. Appl.
**435**(2), 1478–1498 (2016)MathSciNetView ArticleMATHGoogle Scholar - Dowker, J.S.: Relations between the Ehrhart polynomial, the heat kernel and Sylvester waves. (2011).
*Preprint*arXiv:1108.1760v1 [math.NT] - Dowker J.S.: On Sylvester waves and restricted partitions. (2013).
*Preprint*arXiv:1302.6172v2 [math.NT] - Magnus, W., Oberhettinger, F., Tricomi, F.G.: Higher Transcendental Functions, Vol. I. Based, in Part, on Notes Left by Harry Bateman. McGraw-Hill Book Company, Inc., New York (1953)Google Scholar
- Fel, L.G., Rubinstein, B.Y.: Sylvester waves in the Coxeter groups. Ramanujan J.
**6**(3), 307–329 (2002)MathSciNetView ArticleMATHGoogle Scholar - Gessel, I.M.: Applications of the classical umbral calculus. Algebra Universalis
**49**, 397–434 (2003)MathSciNetView ArticleMATHGoogle Scholar - Glaisher, J.W.L.: Formulae for partitions into given elements, derived from Sylvester’s theorem. Quart. J. Pure Appl. Math.
**40**, 275–348 (1908)MATHGoogle Scholar - Nörlund, N.E.: Vorlesungen über Differenzenrechnung. Springer-Verlag, Berlin (1924)View ArticleMATHGoogle Scholar
- O’Sullivan, C.: On the partial fraction decomposition of the restricted partition generating function. Forum Math.
**27**(2), 735–766 (2015)MathSciNetMATHGoogle Scholar - Olver, F.W.J., et al. (eds.): NIST Handbook of Mathematical Functions. Cambridge University Press, New York (2010). http://dlmf.nist.gov/
- Raabe, J.L.: Zurückführung einiger Summen und bestimmten Integrale auf die Jacob-Bernoullische Function. J. Reine Angew. Math.
**42**, 348–367 (1851)View ArticleGoogle Scholar - Rieger, G.J.: Über Partitionen. Math. Ann.
**138**, 356–362 (1959)MathSciNetView ArticleMATHGoogle Scholar - Rota, G.-C., Taylor, B.D.: The classical umbral calculus. SIAM J. Math. Anal.
**25**(2), 694–711 (1994)MathSciNetView ArticleMATHGoogle Scholar - Rubinstein, B.Y.: Expression for restricted partition function through Bernoulli polynomials. Ramanujan J.
**15**(2), 177–185 (2008)MathSciNetView ArticleMATHGoogle Scholar - Rubinstein, B.Y., Fel, L.G.: Restricted partition functions as Bernoulli and Eulerian polynomials of higher order. Ramanujan J.
**11**(3), 331–347 (2006)MathSciNetView ArticleMATHGoogle Scholar - Sills, A.V., Zeilberger, D.: Formulae for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz). Adv. Appl. Math.
**48**(5), 640–645 (2012)MathSciNetView ArticleMATHGoogle Scholar - Sylvester, J.J.: On the partition of numbers. Quarterly J. Pure Appl. Math.
**1**, 141–152 (1857)Google Scholar - Sylvester, J.J.: On subinvariants, i.e. semi-invariants to binary quantics of an unlimited order. Amer. J. Math.
**5**(1), 79–136 (1882)View ArticleGoogle Scholar - Wright, E.M.: Partitions into \(k\) parts. Math. Annalen
**142**, 311–316 (1961)MathSciNetView ArticleMATHGoogle Scholar