2000 character limit reached
On a problem of Nathanson
Published 1 Nov 2017 in math.NT and math.CO | (1711.00174v1)
Abstract: A set $A$ of nonnegative integers is an asymptotic basis of order $h$ if every sufficiently large integer can be represented as the sum of $h$ integers (not necessarily distinct) of $A$. An asymptotic basis $A$ of order $h$ is minimal if no proper subset of $A$ is an asymptotic basis of order $h$. In this paper, we resolve a problem of Nathanson on minimal asymptotic bases of order $h$.
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.