Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1902.09450

Asymptotic complements in the integers

Arindam Biswas·Jyoti Prakash Saha
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $W\subseteq \mathbb{Z}$ be a non-empty subset of the integers. A nonempty set $C\subseteq \mathbb{Z}$ is said to be an asymptotic complement to $W$ if $W+C$ contains almost all the integers except a set of finite size. $C$ is said to be a minimal asymptotic complement if $C$ is an asymptotic complement, but $C\setminus \lbrace c\rbrace$ is not an asymptotic complement $\forall c\in C$. Asymptotic complements have been studied in the context of representations of integers since the time of Erdő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 $\mathbb{Z}$ and deal with a problem of Nathanson on their existence and their inexistence.

Explore related subjects

math.NTmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arindam Biswas, Jyoti Prakash Saha. 2019-12-10. Asymptotic complements in the integers. https://doi.org/10.1016/j.jnt.2019.11.015

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗