A new class of minimal asymptotic bases
Melvyn B. Nathanson

TL;DR
This paper introduces a new class of minimal asymptotic bases, expanding the understanding of how certain sets of integers can uniquely represent large numbers with minimal elements.
Contribution
It constructs a novel class of minimal asymptotic bases, providing new examples and insights into their structure and properties.
Findings
New class of minimal asymptotic bases constructed
Demonstrates the existence of diverse minimal bases
Enhances understanding of additive number theory
Abstract
A set of nonnegative integers is an asymptotic basis of order if every sufficiently large integer can be represented as the sum of not necessarily distinct elements of . The asymptotic basis is minimal if removing any element of destroys every representation of infinitely many integers, and so is not an asymptotic basis of order for all . In this paper, a new class of minimal asymptotic bases is constructed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · semigroups and automata theory
