Search arXivSearch

arXiv · 2508.02607

On a multiplicative non-Hecke twist of motivic L-functions

Abstract

We investigate the twisting of motivic $L$-functions by a family of multiplicative characters $ψ$, defined on prime ideals $\mathfrak{p}$ via $ψ(\mathfrak{p})=α^{N(\mathfrak{p})}$ for a fixed $α\in \mathbb{C}$. One can extend $ψ$ to a continuous non-Hecke character on the idele group of a number field. For $|α|<1$, the resulting $ψ$-twisted $L$-function has interesting analytic properties: an enhanced half-plane of absolute convergence, preservation of the Euler product structure, and meromorphic continuation to the complex plane. We give applications to Dirichlet $L$-functions and $L$-functions associated to modular forms. Furthermore, we show that $ψ$-twisting allows the construction of convergent $p$-adic Dirichlet series and $p$-adic Euler products which have some similarities with their complex counterparts.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Heiko Knospe, Andrzej Dąbrowski. 2025-10-20. On a multiplicative non-Hecke twist of motivic L-functions. https://arxiv.org/abs/2508.02607

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