Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a problem of Nathanson related to minimal asymptotic bases of order $h$

Published 26 Jan 2023 in math.NT | (2301.11148v1)

Abstract: For integer $h\geq2$ and $A\subseteq\mathbb{N}$, we define $hA$ to be all integers which can be written as a sum of $h$ elements of $A$. The set $A$ is called an asymptotic basis of order $h$ if $n\in hA$ for all sufficiently large integers $n$. An asymptotic basis $A$ of order $h$ is minimal if no proper subset of $A$ is an asymptotic basis of order $h$. For $W\subseteq\mathbb{N}$, denote by $\mathcal{F}*(W)$ the set of all finite, nonempty subsets of $W$. Let $A(W)$ be the set of all numbers of the form $\sum_{f \in F} 2f$, where $F \in \mathcal{F}*(W)$. In this paper, we give some characterizations of the partitions $\mathbb{N}=W_1\cup\cdots \cup W_h$ with the property that $A=A(W_1)\cup\cdots \cup A(W_{h})$ is a minimal asymptotic basis of order $h$. This generalizes a result of Chen and Chen, recent result of Ling and Tang, and also recent result of Sun.

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.

Collections

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