MetadataShow full item record
Exact algorithms for p-adic fields and epsilon constant conjectures
We develop several algorithms for computations in Galois extensions of p-adic fields. Our algorithms are based on existing algorithms for number fields and are exact in the sense that we do not need to consider approximations to p-adic numbers. As an application we describe an algorithmic approach to prove or disprove various conjectures for local and global epsilon constants.
SponsorshipThe second author was supported by EPSRC grant GR/S91772/01.
CollectionsMathematische Schriften Kassel (Institut für Mathematik)
The following license files are associated with this item: