Algorithmic proof of the epsilon constant conjecture

From MaRDI portal



Abstract: In this paper we will algorithmically prove the local and global epsilon constant conjectures for all fields of absolute degree lower or equal to 15. To this end we will present an efficient algorithm for the computation of local fundamental classes and address several other problems arising in the algorithmic proof.




Cites work



Describes a project that uses

Uses Software






This page was built for publication: Algorithmic proof of the epsilon constant conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326516)