Rationality and holomorphy of Langlands–Shahidi L-functions over function fields
نویسندگان
چکیده
منابع مشابه
Holomorphy rings of function fields
In his 1974 text, Commutative Ring Theory, Kaplansky states that among the examples of non-Dedekind Prüfer domains, the main ones are valuation domains, the ring of entire functions and the integral closure of a Prüfer domain in an algebraic extension of its quotient field [Kap74, p.72]. A similar list today would likely include Kronecker function rings, the ring of integervalued polynomials an...
متن کاملZeros of Dirichlet L-functions over Function Fields
Random matrix theory has successfully modeled many systems in physics and mathematics, and often analysis in one area guides development in the other. Hughes and Rudnick computed 1-level density statistics for low-lying zeros of the family of primitive Dirichlet L-functions of fixed prime conductor Q, as Q→∞, and verified the unitary symmetry predicted by random matrix theory. We compute 1and 2...
متن کاملSums of Twisted Gl(2) L-functions over Function Fields
Let K be a function field of odd characteristic, and let π (resp., η) be a cuspidal automorphic representation of GL2(AK ) (resp., GL1(AK )). Then we show that a weighted sum of the twists of L(s, π) by quadratic characters χD , ∑ D L(s, π ⊗ χD) a0(s, π, D) η(D) |D|, is a rational function and has a finite, nonabelian group of functional equations. A similar construction in the noncuspidal case...
متن کاملL-Functions of Function Fields
This is a short expository paper on L-functions of function fields, based on the author’s lecture given at the fourth China-Japan number theory conference held in Weihai.
متن کاملDiophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic
Let K be a one-variable function field over a field of constants of characteristic 0. Let R be a holomorphy subring of K, not equal to K. We prove the following undecidability results for R: If K is recursive, then Hilbert’s Tenth Problem is undecidable in R. In general, there exist x1, . . . , xn ∈ R such that there is no algorithm to tell whether a polynomial equation with coefficients in Q(x...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2018
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-018-2100-7