On the restricted partition function via determinants with Bernoulli polynomials

Abstract: Let

r g e q 1

be an integer,

m a t h b f a = (a_{1}, l d o t s, a_{r})

a vector of positive integers and let

D g e q 1

be a common multiple of

a_{1}, l d o t s, a_{r}

. We prove that, if a determinant

D e l t a_{r, D}

, which depends only on

r

and

D

, with entries consisting in values of Bernoulli polynomials is nonzero, then the restricted partition function

p_{m a t h b f a} (n) : =

the number of integer solutions

(x_{1}, d o t s, x_{r})

to

s u m_{j = 1}^{r} a_{j} x_{j} = n

with

x_{1} g e q 0, l d o t s, x_{r} g e q 0

can be computed in terms of values of Bernoulli polynomials and Bernoulli Barnes numbers.

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

This page was built for publication: On the restricted partition function via determinants with Bernoulli polynomials