Computational Number Theory in Relation with L-Functions
COHEN, Henri
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
COHEN, Henri
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
< Reduce
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Language
en
Chapitre d'ouvrage
This item was published in
Notes from the International School on Computational Number Theory, Notes from the International School on Computational Number Theory. 2019p. 171-266
Birkhäuser
English Abstract
We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss ...Read more >
We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss and Jacobi sums), and in the global case (for instance Dirichlet L-functions, involving in particular the study of inverse Mellin transforms); we also give a number of little-known but very useful numerical methods, usually but not always related to the computation of L-functions.Read less <
English Keywords
Hypergeometric motives
Algebraic varieties
L-functions
Gauss sums
Origin
Hal imported