Search arXivSearch

arXiv · 1512.03130

Every finite subset of an abelian group is an asymptotic approximate group

Abstract

If $A$ is a nonempty subset of an additive group $G$, then the $h$-fold sumset is \[ hA = \{x_1 + \cdots + x_h : x_i \in A_i \text{ for } i=1,2,\ldots, h\}. \] The set $A$ is an $(r,\ell)$-approximate group in $G$ if $A$ is a nonempty subset of a group $G$ and there exists a subset $X$ of $G$ such that $|X| \leq \ell$ and $rA \subseteq XA$. We do not assume that $A$ contains the identity, nor that $A$ is symmetric, nor that $A$ is finite. The set $A$ is an asymptotic $(r,\ell)$-approximate group if the sumset $hA$ is an $(r,\ell)$-approximate group for all sufficiently large $h$. It is proved that every polytope in a real vector space is an asymptotic $(r,\ell)$-approximate group, that every finite set of lattice points is an asymptotic $(r,\ell)$-approximate group, and that every finite subset of an abelian group is an asymptotic $(r,\ell)$-approximate group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Melvyn B. Nathanson. 2016-01-14. Every finite subset of an abelian group is an asymptotic approximate group. https://arxiv.org/abs/1512.03130

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT