The 2-stage Euclidean algorithm and the restricted Nagata's pairwise algorithm (Q411742): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.jalgebra.2011.09.029 / rank | |||
Property / review text | |||
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.]. | |||
Property / review text: 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.]. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Władysław Narkiewicz / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 13F07 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11R04 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6029081 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Euclidean algorithm | |||
Property / zbMATH Keywords: Euclidean algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
restricted Nagata pairwise algorithm | |||
Property / zbMATH Keywords: restricted Nagata pairwise algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(k\)-stage Euclidean algorithm | |||
Property / zbMATH Keywords: \(k\)-stage Euclidean algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(\omega\)-stage Euclidean algorithm | |||
Property / zbMATH Keywords: \(\omega\)-stage Euclidean algorithm / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Q5563439 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4138827 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Nagata's pairwise algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the structure of the \(GL_ 2\) of a ring / 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: The restricted Nagata's pairwise algorithm and the Euclidean algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Euclidean algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: About Euclidean rings / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.JALGEBRA.2011.09.029 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:49, 9 December 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
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
0 references