Computing in quotients of rings of integers
Number Theory
2016-12-30 v1 Symbolic Computation
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.
Keywords
Cite
@article{arxiv.1612.09176,
title = {Computing in quotients of rings of integers},
author = {Tommy Hofmann and Claus Fieker},
journal= {arXiv preprint arXiv:1612.09176},
year = {2016}
}