> This may be pretty bad performancewise: in FriCAS exponents > are unlimited, so you may attempt to create number too big > to fit into available memory. Or spent a lot of time > handling huge numbers.
For x1 is represented by (n . e), x2 is represented by (n*2 . e+1), should they have same hash? > This definition is valid only if domain has canonical representation. > Several interesting domains have, but some do not. Notably, field > of fractions of algebraic extentions do not have canonical > representation. So this definition should be conditional. Can you give an example domain? For these domains, they don't have hash implementations I assume? -- 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 post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
