2000 character limit reached
Generalized asymptotic Sidon basis
Published 4 Sep 2019 in math.NT | (1909.01714v2)
Abstract: Let $h,k \ge 2$ be integers. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called $B_{h}[g]$ set if all positive integers can be represented as the sum of $h$ terms from $A$ at most $g$ times. In this paper we prove the existence of $B_{h}[1]$ sets which are asymptotic bases of order $2h+1$ by using probabilistic methods.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.