Search arXivSearch

arXiv · 1905.08075

On Small Sets of Integers

Abstract

An upper quasi-density on $\bf H$ (the integers or the non-negative integers) is a real-valued subadditive function $μ^\ast$ defined on the whole power set of $\mathbf H$ such that $μ^\ast(X) \le μ^\ast({\bf H}) = 1$ and $μ^\ast(k \cdot X + h) = \frac{1}{k}\, μ^\ast(X)$ for all $X \subseteq \bf H$, $k \in {\bf N}^+$, and $h \in \bf N$, where $k \cdot X := \{kx: x \in X\}$; and an upper density on $\bf H$ is an upper quasi-density on $\bf H$ that is non-decreasing with respect to inclusion. We say that a set $X \subseteq \bf H$ is small if $μ^\ast(X) = 0$ for every upper quasi-density $μ^\ast$ on $\bf H$. Main examples of upper densities are given by the upper analytic, upper Banach, upper Buck, and upper Pólya densities, along with the uncountable family of upper $α$-densities, where $α$ is a real parameter $\ge -1$ (most notably, $α= -1$ corresponds to the upper logarithmic density, and $α= 0$ to the upper asymptotic density). It turns out that a subset of $\bf H$ is small if and only if it belongs to the zero set of the upper Buck density on $\bf Z$. This allows us to show that many interesting sets are small, including the integers with less than a fixed number of prime factors, counted with multiplicity; the numbers represented by a binary quadratic form with integer coefficients whose discriminant is not a perfect square; and the image of $\bf Z$ through a non-linear integral polynomial in one variable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paolo Leonetti, Salvatore Tringali. 2020-10-29. On Small Sets of Integers. https://doi.org/10.1007/s11139-020-00371-x

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