Search arXivSearch

arXiv · 2406.13976

Euler factors of equivariant $L$--functions of Drinfeld modules and beyond

Abstract

In \cite{FGHP}, the first author and his collaborators proved an equivariant Tamagawa number formula for the special value at $s=0$ of a Goss--type $L$--function, equivariant with respect to a Galois group $G$, and associated to a Drinfeld module defined on $\Bbb F_q[t]$ and over a finite, integral extension of $\Bbb F_q[t]$. The formula in question was proved provided that the values at $0$ of the Euler factors of the equivariant $L$--function in question satisfy certain identities involving Fitting ideals of certain $G$--cohomologically trivial, finite $\Bbb F_q[t][G]$--modules associated to the Drinfeld module. In \cite{FGHP}, we prove these identities in the particular case of the Carlitz module. In this paper, we develop general techniques and prove the identities in question for arbitrary Drinfeld modules. Further, we indicate how these techniques can be extended to the more general case of higher dimensional abelian $t$--modules, which is relevant in the context of the proof of the equivariant Tamagawa number formula for abelian $t$--modules given by N. Green and the first author in \cite{Green-Popescu}. This paper is based on a lecture given by the first author at ICMAT Madrid in May 2023 and builds upon results obtained by the second author in his PhD thesis \cite{Ramachandran-thesis}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristian D. Popescu, Nandagopal Ramachandran. 2024-06-20. Euler factors of equivariant $L$--functions of Drinfeld modules and beyond. https://arxiv.org/abs/2406.13976

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