pith. sign in

arxiv: 2605.28973 · v1 · pith:24QIY3WOnew · submitted 2026-05-27 · 🧮 math.NT

Asymptotic formulas for sums of elements from a multiplicative group

classification 🧮 math.NT
keywords numberasymptoticalphacdotselementsformulasgammainfty
0
0 comments X
read the original 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 $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the absolute exponential height of an algebraic number $\alpha$. Fix non-zero elements $a_1\kdots a_k\in K$. We give asymptotic formulas for the number of $\mathbf{x}=(x_1\kdots x_k)\in\Gamma$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.