2000 character limit reached
On asymptotic bases and minimal asymptotic bases
Published 25 Oct 2018 in math.NT | (1810.10925v2)
Abstract: Let $\mathbb{N}$ denote the set of all nonnegative integers and $A$ be a subset of $\mathbb{N}$. Let $h\geq2$ and let $r_h(A,n)=\sharp { (a_1,\ldots,a_h)\in A{h}: a_1+\cdots+a_h=n}.$ The set $A$ is called an asymptotic basis of order $h$ if $r_h(A,n)\geq 1$ 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$. Recently, Chen and Tang resoved a problem of Nathanson on minimal asymptotic bases of order $h$. In this paper, we generalized this result to $g$-adic representations.
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.