Exact algorithms for p-adic fields and epsilon constant conjectures
dc.date.accessioned | 2006-12-08T09:55:49Z | |
dc.date.available | 2006-12-08T09:55:49Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | urn:nbn:de:hebis:34-2006120816196 | |
dc.identifier.uri | http://hdl.handle.net/123456789/2006120816196 | |
dc.description.sponsorship | The second author was supported by EPSRC grant GR/S91772/01. | eng |
dc.format.extent | 306905 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.rights | Urheberrechtlich geschützt | |
dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
dc.subject | Algorithmen in p-adischen Galoiserweiterungen | ger |
dc.subject | Epsilon-Konstanten-Vermutungen | ger |
dc.subject.ddc | 510 | |
dc.title | Exact algorithms for p-adic fields and epsilon constant conjectures | eng |
dc.type | Preprint | |
dcterms.abstract | 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. | eng |
dcterms.accessRights | open access | |
dcterms.creator | Bley, Werner | |
dcterms.creator | Breuning, Manuel | |
dcterms.isPartOf | Mathematische Schriften Kassel ;; 06, 10 | ger |
dc.subject.msc | 11R42 | eng |
dc.subject.msc | 11S20 | eng |
dc.subject.msc | 11S40 | eng |
dc.subject.msc | 11Y42 | eng |
dcterms.source.journal | Mathematische Schriften Kassel | ger |
dcterms.source.volume | 06, 10 |