arXiv:2611.25250v1 Announce Type: new 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 $a_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(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.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page