The 2-stage Euclidean algorithm and the restricted Nagata's pairwise algorithm (Q411742): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jalgebra.2011.09.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048168251 / rank
 
Normal rank

Revision as of 01:34, 20 March 2024

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

    Statements

    The 2-stage Euclidean algorithm and the restricted Nagata's pairwise algorithm (English)
    0 references
    0 references
    0 references
    30 April 2012
    0 references
    The paper deals with two generalizations of the Euclidean algorithm in a commutative ring \(R\): the \(k\)-stage Euclidean algorithm introduced by \textit{G. E. Cooke} [J. Reine Angew. Math. 282, 133--156 (1976; Zbl 0328.13013)] and the restricted Nagata pairwise algorithm (\(RNPA\)) [\textit{M.-G. Leu}, Osaka Math. J., 45, 807--818 (2008; Zbl 1152.13016)]. In the case when \(R\) is a unique factorization domain the authors present a construction of the smallest \(RNPA\) in \(R\) (Theorem 2.3). Then they generalize the algorithm of Cooke, replacing in its definition the set of positive integers by an arbitrary well-ordered set and develop its properties. This permits them to construct infinitely many integral domains which are \(\omega\)-stage Euclidean, but not \(2\)-stage Euclidean. This was an open problem posed by Cooke [loc. cit.].
    0 references
    Euclidean algorithm
    0 references
    restricted Nagata pairwise algorithm
    0 references
    \(k\)-stage Euclidean algorithm
    0 references
    \(\omega\)-stage Euclidean algorithm
    0 references

    Identifiers