arXiv · 1107.2745
Algorithmic Proof of the Epsilon Constant Conjecture
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.
Explore related subjects
Keep this discovery
Werner Bley, Ruben Debeerst. 2011-07-14. Algorithmic Proof of the Epsilon Constant Conjecture. https://arxiv.org/abs/1107.2745
Cite the original work for its findings. Save a collection to share your selection of sources.