English

On semilinear sets and asymptotically approximate groups

Number Theory 2019-02-18 v1 Combinatorics Group Theory

Abstract

Let GG be any group and AA be an arbitrary subset of GG (not necessarily symmetric and not necessarily containing the identity). The hh-fold product set of AA is defined as Ah:={a1.a2...ah:a1,,anA}.A^{h} :=\lbrace a_{1}.a_{2}...a_{h} : a_{1},\ldots,a_n \in A \rbrace. Nathanson considered the concept of an asymptotic approximate group. Let r,lNr,l \in \mathbb{N}. The set AA is said to be an (r,l)(r,l) approximate group in GG if there exists a subset XX in GG such that Xl|X|\leqslant l and ArXAA^{r}\subseteq XA. The set AA is an asymptotic (r,l)(r,l)-approximate group if the product set AhA^{h} is an (r,l)(r,l)-approximate group for all sufficiently large hh. Recently, Nathanson showed that every finite subset AA of an abelian group is an asymptotic (r,l)(r,l') approximate group (with the constant ll' explicitly depending on rr and AA). We generalise the result and show that, in an arbitrary abelian group GG, the union of kk (unbounded) generalised arithmetic progressions is an asymptotic (r,(4rk)k)(r,(4rk)^k)-approximate group.

Keywords

Cite

@article{arxiv.1902.05757,
  title  = {On semilinear sets and asymptotically approximate groups},
  author = {Arindam Biswas and Wolfgang Alexander Moens},
  journal= {arXiv preprint arXiv:1902.05757},
  year   = {2019}
}
R2 v1 2026-06-23T07:41:53.122Z