Arithmetic Upper and Lower Bounds for the Denumerant Function I

arXiv:2204.13689 · math.NT · Submitted 2022-04-28 · Read on arXiv

math.NT

Submitted: 2022-04-28

Updated: 2026-11-18

Comments: 16 pages. Apart from minor corrections, the results are those of the previous versions; only the presentation has changed: lighter notation, statements for arbitrary gcd(a_1,...,a_k) (which reduces to the coprime case), self-contained and fully elementary proofs (no Popoviciu formula, no differentiation), a few complementary remarks, and a comparison with later work of Gajdzica

License: http://creativecommons.org/licenses/by-nc-nd/4.0/

The gist: We use an elementary arithmetic argument, going back to Blom and Fr ö berg, to obtain upper and lower bounds for the denumerant function of Sylvester for arbitrary positive integers a 1,,a k.

Terminology

Abstract

We use an elementary arithmetic argument, going back to Blom and Fr ö berg, to obtain upper and lower bounds for the denumerant function of Sylvester for arbitrary positive integers a 1,,a k. The bounds hold along the multiples of (a 1,,a k), share the leading term of the denumerant, and yield its asymptotic behaviour with an explicit error term; for large n and under a mild condition, a polynomial refinement of the lower bound improves on the lower bound of Agnarsson.

Related papers