Search arXivSearch

arXiv · 2209.03023

On the Hurwitz-type zeta function associated to the Lucas sequence

Abstract

We study the theta function and the Hurwitz-type zeta function associated to the Lucas sequence $U=\{U_n(P,Q)\}_{n\geq 0}$ of the first kind determined by the real numbers $P,Q$ under certain natural assumptions on $P$ and $Q$. We deduce an asymptotic expansion of the theta function $θ_U(t)$ as $t\downarrow 0$ and use it to obtain a meromorphic continuation of the Hurwitz-type zeta function $ζ_{U}\left( s,z\right) =\sum\limits_{n=0}^{\infty }\left(z+U_{n}\right) ^{-s}$ to the whole complex $s-$plane. Moreover, we identify the residues of $ζ_{U}\left( s,z\right)$ at all poles in the half-plane $\Re(s)\leq 0$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lejla Smajlović, Zenan Šabanac, Lamija Šćeta. 2022-09-07. On the Hurwitz-type zeta function associated to the Lucas sequence. https://arxiv.org/abs/2209.03023

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