On the restricted partition function via determinants with Bernoulli polynomials
Abstract
Let r≥ 1 be an integer, a=(a1,…,ar) a vector of positive integers and let D≥ 1 be a common multiple of a1,…,ar. We prove that, if a determinant 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 a(n): = the number of integer solutions (x1,…,xr) to Σj=1r ajxj=n with x1≥ 0, …, xr≥ 0 can be computed in terms of values of Bernoulli polynomials and Bernoulli Barnes numbers.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.