Waldek Hebisch <[EMAIL PROTECTED]> writes: > 2) I think we have all tools to do actual computations: we can factorise > in algebraic extensions, so we can verify irreducibility assumptions. > We have functions to compute primitive elements.
I was unable to use the latter. Do you think you could compute the example I gave with FriCAS? > 3) Currently constructors can not be overloaded, Yes, that's unfortunate, in my opinion... > so any extra argument to SAE would be mandatory. One could try something > like: > > SimpleAlgebraicExtension(R:CommutativeRing, _ > UP:UnivariatePolynomialCategory R, M: Union(UP, List UP)) == ... > > but that would complicate SAE. Yes, that's the way I would do it. But I think that code is missing. > 4) Another possibilty would be to add type-valued function in the > interpreter. This may be simple (again modulo bugs/limitations). I think that this would be very nice and desirable (also for the species project), but I do not see what it has to do with the problem at hand. Never mind, (2) is much more important... Martin --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en -~----------~----~----~----~------~----~------~--~---
