Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T04:53:16.528Z Has data issue: false hasContentIssue false

An algorithm for the principal ideal problem in indefinite quaternion algebras

Published online by Cambridge University Press:  01 August 2014

A. Page*
Affiliation:
Université Bordeaux, IMB UMR 5251, F-33400 Talence, France email aurel.page@math.u-bordeaux1.frCNRS, IMB, UMR 5251, F-33400 Talence, FranceINRIA, F-33400 Talence, France

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.