Search arXivSearch

arXiv · 2607.19525

Additive and multiplicative densities, prime valuations and symbolic models

Abstract

We study additive and multiplicative densities of subsets of $\N$ along prescribed Følner sequences. We prove that additive upper density one implies multiplicative density one along a suitable multiplicative Følner sequence. We also prove independence in the following sense: given an additive Følner sequence $(G_n)_n$, a multiplicative Følner sequence $(F_n)_n$, and any $(α,β)\in[0,1]^2$, we construct a single set $A\subseteq\N$ such that $\dens_{(G_n)_n}(A)=α$ and $\md_{(F_n)_n}(A)=β$. Prime-valuation coordinates yield exact density formulas and random models for one local condition and, under summability assumptions, countably many; in the finite-coordinate case they also give exact higher-order correlations. Finally, we realize these multiplicative correlations as correlations in symbolic dynamical systems and obtain criteria for ergodicity and mixing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Natalia Mora Cuellar, Ignacio Rojas Aravena, Alexia Yavicoli. 2026-07-21. Additive and multiplicative densities, prime valuations and symbolic models. https://arxiv.org/abs/2607.19525

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