arXiv · 1405.6674
An algorithm for the principal ideal problem in indefinite quaternion algebras
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.
Explore related subjects
Keep this discovery
Aurel Page. 2014-05-26. An algorithm for the principal ideal problem in indefinite quaternion algebras. https://doi.org/10.1112/s1461157014000321
Cite the original work for its findings. Save a collection to share your selection of sources.