<p>We design an algorithm for computing the <i>L</i>-series associated to an Anderson <i>t</i>-motive, exhibiting quasilinear complexity with respect to the target precision. Based on experiments, we conjecture that, after renormalization by the local factor at <i>v</i>, the order of vanishing at <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40993_2024_588_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(T=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> of the <i>v</i>-adic <i>L</i>-series of a given Anderson <i>t</i>-motive does not depend on the finite place <i>v</i>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

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

  • Xavier Caruso,
  • Quentin Gazda

摘要

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\) T = 1 of the v-adic L-series of a given Anderson t-motive does not depend on the finite place v.