Paul Elliott's profile - activity

I am writing a polymorphic function that implements an algorithm that should work in all euclidean domains. My function should work in all euclidean domains, even ones that have not been implemented yet. My algorithm uses the euclidean function. How do I polymorphically get the canonical euclidean function for my particular domain?

But this does not answer how you get it to print out an exact answer. That is, I want it to print out: (x-2^(1/3)), ( x + (2^(1.3) )/2 + i ( 2^(1/3)* (sqrt(3)/2) ), ( x + (2^(1.3) )/2 - i ( 2^(1/3)* (sqrt(3)/2) )

How do I make it print this out?

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.

I hold 30 year old MS in math, but I have not used it for many years. Recently, I started to refresh my abstract algebra, by studing Dean. I decided to use sage so I could learn CAS at the same time. I had some questions, so I tried to join the sage abstract algebra newsgroup. I got the following reply: Google Groups: Your subscription request is denied Your subscription to sage-algebra was not approved.

What is the deal? Is the group limited to research mathematicians?

I am sorry for trying to disturb sage-algebra's purity.