how did sage newsgroups get so stuck up?

edit

One of my questions was: why can't you write polymorphic code that will work in any Euclidean domain? The implementation for gcd is different for integers and polynomial over fields. Ok, maybe that is for speed. But the point is you can't write general code even if you wanted to. You have to reconstruct the euclidean function depending on the kind of ring you are working on. That is you have to write code like this: if integer use absolute value, if polynomial over field use degree, if gausian use norm. This is the kind of code that polymorphism was designed to prevent and I would like to ask questions about it. These questions should go in sage-algebra.

In that case my guess is that one of two things happened. 1) Nobody bothers to monitor the request and Google has a time limit? 2) No one knew who you were and the subscription message maybe seemed like a potential spammer (which are, very unfortunately, legion)? In any case, that's unfortunate, and I'm sure they wouldn't have any problem with a request in general, the bar tends mostly to be for spam reduction on lists I am on (which is not sage-algebra, to be clear, so perhaps you are right).

Just try again. If it still fails email William Stein, he is the list owner.