On Monday, 16 February 2015 12:01:31 UTC+1, Jeroen Demeyer wrote: > > On 2015-02-14 16:40, Bill Hart wrote: > > Wikipedia claims that it is possible to compute gcd in R[x] for any > > unique factorisation domain R. But in thinking about it last night, I > > couldn't see why the algorithm doesn't work in any GCD domain R. > Perhaps it works for GCD domains, but the proofs are harder? > > Also: a Noetherian GCD domain is an UFD. Rings which come up in computer > algebra are almost always Noetherian, so there might be no need for that > generality. >
Yes, that could be the reason. In fact you only need the ascending chain condition on principal ideals, not Noetherian in general. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
