An algorithm for the principal ideal problem in indefinite quaternion algebras
Number Theory
2014-08-13 v1
Abstract
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the underlying number field. Finding a generator is hard, and we present a heuristically subexponential algorithm.
Cite
@article{arxiv.1405.6674,
title = {An algorithm for the principal ideal problem in indefinite quaternion algebras},
author = {Aurel Page},
journal= {arXiv preprint arXiv:1405.6674},
year = {2014}
}
Comments
To appear in ANTS XI