On Fri, Mar 23, 2012 at 10:16:06PM +0400, Serge D. Mechveliani wrote: > Can you, please, explain: > how to construct recursively the domains R for which Axiom has the > `factor' operation in R[x1..xn] == MPOLY([x1..xn], R) > ? > More definitely, denote this class FF and consider the following > constructors. > > (1) INT and Q = Fraction INT belong to FF, as I recall. > [..]
Please, withdraw this request. Because I look by "Browse" into numerous library packages which contain `factor', and see how `factor' is spread. Regards, ------ Sergei [email protected] -- 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.
