4.3 Article

THE FROBENIUS POSTAGE STAMP PROBLEM, AND BEYOND

期刊

ACTA MATHEMATICA HUNGARICA
卷 161, 期 2, 页码 700-718

出版社

SPRINGER
DOI: 10.1007/s10474-020-01073-y

关键词

Frobenius number; sumset

资金

  1. European Research Council [670239]
  2. Natural Sciences and Engineering Research Council of Canada (NSERC) under the Canada Research Chairs program
  3. Ben Green's Simons Investigator Grant [376201]

向作者/读者索取更多资源

Let A be a finite subset of Z(n), which generates Z(n) additively. We provide a precise description of the N-fold sumsets NA for N sufficiently large, with some explicit bounds on sufficiently large.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据