Exact algorithms for \(p\)-adic fields and epsilon constant conjectures
From MaRDI portal
Publication:733352
zbMath1205.11140MaRDI QIDQ733352
Publication date: 15 October 2009
Published in: Illinois Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ijm/1254403714
Integral representations (11S23) Galois cohomology (11S25) Algebraic number theory computations (11Y40)
Related Items (2)
Algorithmic proof of the epsilon constant conjecture ⋮ On the equivariant Tamagawa number conjecture for Tate motives and unconditional annihilation results
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact sequences and Galois module structure
- An algorithm for the construction of a normal basis
- A modular method for computing the Galois groups of polynomials
- Computing local Artin maps, and solvability of norm equations
- On the computation of all extensions of a 𝑝-adic field of a given degree
- Computations in Relative Algebraic K-Groups
- Les Constantes des Equations Fonctionnelles des Fonctions L
- Cohomology and group extensions in Magma
- Equivariant Epsilon Constants, Discriminants and Étale Cohomology
- On equivariant global epsilon constants for certain dihedral extensions
- EQUIVARIANT LOCAL EPSILON CONSTANTS AND ÉTALE COHOMOLOGY
- Numerical Evidence for a Conjectural Generalization of Hilbert's Theorem 132
- Advanced Topics in Computional Number Theory
- Algorithmic Number Theory
- Global lifting of local extensions: Some embedding problems
- Galois group computation for rational polynomials
This page was built for publication: Exact algorithms for \(p\)-adic fields and epsilon constant conjectures