Search arXiv⌕ Search

arXiv · 2610.15416

On strongly minimal asymptotic bases of order $h$ generated by powers of $2$

Abstract

Let $h\geq2$ be an integer and let $\mathbb{N}_0=W_1\cup\cdots\cup W_h$ be a partition into infinite sets. For $W\subseteq\mathbb{N}_0$, let $A(W)$ denote the set of all finite nonempty sums of distinct powers $2^w$ with $w\in W$. We give a necessary and sufficient condition for $A=A(W_1)\cup\cdots\cup A(W_h)$ to be a strongly minimal asymptotic basis of order $h$. This provides a complete answer to a problem posed by Nathanson in 1988.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shi-Qiang Chen, Xin-Yue Yan. 2026-10-11. On strongly minimal asymptotic bases of order $h$ generated by powers of $2$. https://arxiv.org/abs/2610.15416

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗