The PSLQ procedure can be regarded as a jazzed-up version of an integer-relation algorithm dating back more than 2,000 years to the Greek geometer Euclid of Alexandria (365–300 B.C.). The Euclidean ...

Let K be a number field with unit rank at least four, containing a subfield M such that K/M is Galois of degree at least four. We show that the ring of integers of K is a Euclidean domain if and only ...

I'm looking for what the title says. Euclidean algorithm works and is fast for just a pair of numbers, but I don't see any obvious generalizations. A quick googling didn't turn up anything too ...

This is a preview. Log in through your library . Journal Information The Bulletin of Symbolic Logic was established in 1995 by the Association for Symbolic Logic (ASL) to provide a journal of high ...