The restricted Nagata's pairwise algorithm and the Euclidean algorithm (Q953942): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nagata's pairwise algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weakening of the euclidean property for integral domains and applications to algebraic number theory. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ℤ[] is Euclidean / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3478508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About Euclidean rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732721 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:56, 28 June 2024

scientific article
Language Label Description Also known as
English
The restricted Nagata's pairwise algorithm and the Euclidean algorithm
scientific article

    Statements

    The restricted Nagata's pairwise algorithm and the Euclidean algorithm (English)
    0 references
    0 references
    7 November 2008
    0 references
    \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\).
    0 references
    0 references
    Euclidean algorithm
    0 references