The restricted Nagata's pairwise algorithm and the Euclidean algorithm
From MaRDI portal
\textit{M. Nagata} introduced [in: Algebraic geometry seminar. Proceedings of the seminar, Singapore, November 3--6, 1987. Singapore: World Scientific, 69--74 (1988; Zbl 0947.14500)] a generalization of the Euclidean algorithm. The author presents a modification of this algorithm, develops its properties and shows that if this algorithm exists in a ring of integers of a quadratic number field \(Q(\sqrt{-d})\), then \(d=1,2,3,7\) or \(11\).
Recommendations
Cites work
- A weakening of the euclidean property for integral domains and applications to algebraic number theory. I.
- About Euclidean rings
- scientific article; zbMATH DE number 4148250 (Why is no real title available?)
- scientific article; zbMATH DE number 3656095 (Why is no real title available?)
- scientific article; zbMATH DE number 3450338 (Why is no real title available?)
- scientific article; zbMATH DE number 3196340 (Why is no real title available?)
- On Nagata's pairwise algorithm
- The Euclidean algorithm
- ℤ[] is Euclidean
Cited in
(6)- On the minimal algorithm in rings of imaginary quadratic integers
- On Nagata's pairwise algorithm
- Products of elementary matrices and non-Euclidean principal ideal domains
- On a proposition of Samuel and 2-stage Euclidean algorithm in global fields
- The 2-stage Euclidean algorithm and the restricted Nagata's pairwise algorithm
- Note on the Euclidean Algorithm
This page was built for publication: The restricted Nagata's pairwise algorithm and the Euclidean algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953942)
