English

Compact symmetric solutions to the postage stamp problem

Number Theory 2014-01-30 v2

Abstract

We derive lower and upper bounds on possible growth rates of certain sets of positive integers Ak={1=a1<a2<...<ak}A_k=\{1= a_1 < a_2 < ... < a_{k}\} such that all integers n{0,1,2,...,kak}n\in \{0, 1, 2, ..., ka_{k}\} can be represented as a sum of no more than kk elements of AkA_k, with repetition.

Keywords

Cite

@article{arxiv.0706.3250,
  title  = {Compact symmetric solutions to the postage stamp problem},
  author = {Hugh Thomas and Stephanie van Willigenburg},
  journal= {arXiv preprint arXiv:0706.3250},
  year   = {2014}
}
R2 v1 2026-06-21T08:40:59.420Z