Papers
Topics
Authors
Recent
Search
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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.