On asymptotic approximate groups of integers
From MaRDI portal
Abstract: Let be a positive integer, and let be a nonempty finite set of at least two integers. We let denote the {em asymptotic -covering number} of , that is, the smallest integer value of for which, for all sufficiently large positive integers , the -fold sumset of is contained in at most translates of the -fold sumset of . Nathanson proved that is always at most ; here we extend this result to prove that is always at least , and determine all sets for which .
Recommendations
Cites work
- A brief introduction to approximate groups
- Approximate groups and doubling metrics
- Every finite set of integers is an asymptotic approximate group
- scientific article; zbMATH DE number 933467 (Why is no real title available?)
- Product set estimates for non-commutative groups
- The structure of approximate groups.
- What is \dots an approximate group?
Cited in
(8)- On semilinear sets and asymptotic approximate groups
- On the asynchronous rational group
- Every finite set of integers is an asymptotic approximate group
- scientific article; zbMATH DE number 4134286 (Why is no real title available?)
- An asymptotic formula for real groups
- scientific article; zbMATH DE number 1004943 (Why is no real title available?)
- scientific article; zbMATH DE number 7310102 (Why is no real title available?)
- Rough approximations on L-groups
This page was built for publication: On asymptotic approximate groups of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384194)