Search arXivSearch

arXiv · 2605.28973

Asymptotic formulas for sums of elements from a multiplicative group

Abstract

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $Γ$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(α)$ denote the absolute exponential height of an algebraic number $α$. Fix non-zero elements $a_1,\ldots , a_k\in K$. We give asymptotic formulas for the number of $\mathbf{x}=(x_1,\ldots , x_k)\inΓ$ with $H(a_1x_1+\cdots +a_kx_k)\leq X$ as $X\to\infty$ such that no non-empty subsum of $a_1x_1+\cdots +a_kx_k$ vanishes. By the same method of proof, we obtain an asymptotic formula as $X\to\infty$ for the number of non-negative integers $n$ with $H(u_n)\leq X$, where $\{ u_n\}$ is a linear recurrence sequence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan-Hendrik Evertse, Kálmán Győry, Lajos Hajdu, Florian Luca, László Remete. 2026-05-29. Asymptotic formulas for sums of elements from a multiplicative group. https://arxiv.org/abs/2605.28973

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