Partly motiveted by Ralf, partly by needs of various algorithms
I looked at "algebraic" operations that we offer, and it seems
that we miss or at least make hard to use some operation. For
example consider 'minimalPolynomial', we have that in
SimpleAlgebraicExtention, FramedAlgebra, finite fields and in
Complex. However, AFAICS only finite fields give possiblity
to compute minimal polynomial over someting different than
parameter of the domain. So when dealing with towers, we do
not have easy way to compute minimal polynomial of element of
the tower with respect to base field.
What could be done here? One possble way would equip each
stage of tower with structure of FramedAlgebra over base
field. Another way could use triangular systems, we could
specify a field extention via triangular system giving
equations for generators and do computations there (possibly
going to SimpleAlgebraicExtention via primitive element).
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/ZK8yuJfjC2Ck4HQB%40fricas.math.uni.wroc.pl.
