Skip to main navigation Skip to search Skip to main content

Computation of classical and v-adic L-series of t-motives

  • Centre national de la recherche scientifique

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

We design an algorithm for computing the L-series associated to an Anderson t-motive, exhibiting quasilinear complexity with respect to the target precision. Based on experiments, we conjecture that, after renormalization by the local factor at v, the order of vanishing at T=1 of the v-adic L-series of a given Anderson t-motive does not depend on the finite place v.

Original languageEnglish
Article number35
JournalResearch in Number Theory
Volume11
Issue number1
DOIs
Publication statusPublished - 1 Mar 2025

Keywords

  • Algorithms
  • Anderson motives
  • L-series

Fingerprint

Dive into the research topics of 'Computation of classical and v-adic L-series of t-motives'. Together they form a unique fingerprint.

Cite this