arXiv · 1612.09176
Computing in quotients of rings of integers
Abstract
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and their behavior under certain quotients. We illustrate the power of our ideas in a new modular normal form algorithm for modules over rings of integers, vastly outperforming classical algorithms.
Explore related subjects
Keep this discovery
Tommy Hofmann, Claus Fieker. 2016-12-29. Computing in quotients of rings of integers. https://doi.org/10.1112/s1461157014000291
Cite the original work for its findings. Save a collection to share your selection of sources.