Explicit division algorithms are given for each of the finitely many norm-Euclidean imaginary quadratic fields guaranteeing a remainder of norm strictly less than the field's Euclidean minimum.
Computing gre atest common divisors and factor- izations in quadratic number fields
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Division algorithms for norm-Euclidean imaginary quadratic fields
Explicit division algorithms are given for each of the finitely many norm-Euclidean imaginary quadratic fields guaranteeing a remainder of norm strictly less than the field's Euclidean minimum.