This issue comes up periodically, but no-one (as far as I know) has come up with a good algorithm. The obvious one here is what you get if you work in the fraction field of Z[X] instead of Q[X]. Are there other special cases which should be handled apart from coefficient rings which are fields of fractions of PIDs or UFDs?
John On 14 April 2012 10:46, [email protected] <[email protected]> wrote: > In the following code: > > sage: R.<X> = QQ[] > sage: 2/(2*X) > 2/(2*X) > > Is there a case against simplifying 2/(2*X) to 1/X? If it is a bug, it seems > to me that we need a new set of "non_monic_gcd" functions for all ring > element classes that uses generic reduction (or is there a less invasive > solution?). On the other hand, If there's such a case against that > simplification (speed, no need to simplify, why does it matter, etc) please > enlighten me as well, because It's making my function field computations, > exponentialy slower, as my fractions grow into scary objects as time passes. > > Thanks. > Syd > > -- > To post to this group, send an email to [email protected] > To unsubscribe from this group, send an email to > [email protected] > For more options, visit this group at > http://groups.google.com/group/sage-devel > URL: http://www.sagemath.org -- To post to this group, send an email to [email protected] To unsubscribe from this group, send an email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
