English

Sylvester sums on the Frobenius set in arithmetic progression

Number Theory 2022-03-24 v1 Combinatorics

Abstract

Let a1,a2,,aka_1,a_2,\dots,a_k be positive integers with gcd(a1,a2,,ak)=1\gcd(a_1,a_2,\dots,a_k)=1. The concept of the weighted sum nNRλn\sum_{n\in{\rm NR}}\lambda^{n} is introduced in \cite{KZ0,KZ}, where NR=NR(a1,a2,,ak){\rm NR}={\rm NR}(a_1,a_2,\dots,a_k) denotes the set of positive integers nonrepresentable in terms of a1,a2,,aka_1,a_2,\dots,a_k. When λ=1\lambda=1, such a sum is often called Sylvester sum. The main purpose of this paper is to give explicit expressions of the Sylvester sum (λ=1\lambda=1) and the weighed sum (λ1\lambda\ne 1), where a1,a2,,aka_1,a_2,\dots,a_k forms arithmetic progressions. As applications, various other cases are also considered, including weighted sums, almost arithmetic sequences, arithmetic sequences with an additional term, and geometric-like sequences. Several examples illustrate and confirm our results.

Keywords

Cite

@article{arxiv.2203.12238,
  title  = {Sylvester sums on the Frobenius set in arithmetic progression},
  author = {Takao Komatsu},
  journal= {arXiv preprint arXiv:2203.12238},
  year   = {2022}
}

Comments

In: F. Yilmaz et al. (eds.), Mathematical Methods for Engineering Applications, Springer Proceedings in Mathematics & Statistics, vol. 384. Springer, Cham., 2022 May. (to appear)