Abstract: Let be a non-empty subset of the integers. A nonempty set is said to be an asymptotic complement to if contains almost all the integers except a set of finite size. is said to be a minimal asymptotic complement if is an asymptotic complement, but is not an asymptotic complement . Asymptotic complements have been studied in the context of representations of integers since the time of ErdH{o}s, Hanani, Lorentz and others, while the notion of minimal asymptotic complements is due to Nathanson. In this article, we study minimal asymptotic complements in and deal with a problem of Nathanson on their existence and their inexistence.
Recommendations
Cites work
- On a Problem of Additive Number Theory
- On a problem of Erdös in additive number theory
- On a problem of Nathanson related to minimal additive complements
- On additive complements
- On additive complements. III
- On minimal additive complements of integers
- On minimal complements in groups
- Problems in additive number theory. IV: Nets in groups and shortest length \(g\)-adic repre\-sentations
- Some Results on Additive Number Theory
- Some unsolved problems
Cited in
(7)- On minimal additive complements of integers
- On non-minimal complements
- Infinite co-minimal pairs in the integers and integral lattices
- scientific article; zbMATH DE number 6272375 (Why is no real title available?)
- On additive co-minimal pairs
- On eventually periodic sets as minimal additive complements
- Royden compactification of integers
This page was built for publication: Asymptotic complements in the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182153)