betaFeedback

WorksMathematics

Arithmetic Upper and Lower Bounds for the Denumerant Function II

Abstract

We apply the elementary arithmetic argument of the first paper of this series (arXiv:2204.13689) to binomial coefficients, and obtain upper and lower bounds for Sylvester's denumerant function for arbitrary positive integers a1,…,aka_1,\dots,a_k that sharpen those of Agnarsson. The lower bound is a sum of binomial coefficients; it holds along the multiples of gcd⁡(a1,…,ak)\gcd(a_1,\dots,a_k) without assuming that a solution exists, and it is greater than the polynomial lower bound of the first paper. In the upper bound the shift of Agnarsson's binomial coefficient is reduced.

Paper details

vlnc:W_yceqdzy7
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC-BY-NC-ND-4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Claude

View statement
Looking for related papers…