English

Weighted Sylvester sums on the Frobenius set in more variables

Number Theory 2022-03-24 v3 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. Let NR=NR(a1,a2,,ak){\rm NR}={\rm NR}(a_1,a_2,\dots,a_k) denote the set of positive integers nonrepresentable in terms of a1,a2,,aka_1,a_2,\dots,a_k. The largest nonrepresentable integer maxNR\max{\rm NR}, the number of nonrepresentable positive integers nNR1\sum_{n\in{\rm NR}}1 and the sum of nonrepresentable positive integers nNRn\sum_{n\in{\rm NR}}n have been widely studied for a long time as related to the famous Frobenius problem. In this paper by using Eulerian numbers, we give formulas for the weighted sum nNRλnnμ\sum_{n\in{\rm NR}}\lambda^{n}n^\mu, where μ\mu is a nonnegative integer and λ\lambda is a complex number. We also examine power sums of nonrepresentable numbers and some formulae for three variables. Several examples illustrate and support our results.

Keywords

Cite

@article{arxiv.2101.04298,
  title  = {Weighted Sylvester sums on the Frobenius set in more variables},
  author = {Takao Komatsu and Yuan Zhang},
  journal= {arXiv preprint arXiv:2101.04298},
  year   = {2022}
}