Algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank
Rings and Algebras
2017-03-30 v4 Symbolic Computation
Abstract
We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime or prime power. The main algorithm is based on basis representation of finite rings which is computed via Hermite and Smith normal forms.
Cite
@article{arxiv.1406.3523,
title = {Algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank},
author = {Dandan Huang and Yingpu Deng},
journal= {arXiv preprint arXiv:1406.3523},
year = {2017}
}
Comments
14 pages