Hi Oliver, On 2 Feb., 10:54, Oliver Block <oliver_blo...@web.de> wrote: > Thank you for the clarification. At the moment I am not very motivated > to work with development code. So I will probably wait for the release > of sage 5.0 (this is hopefully not too far in the future?).
I used the 5.0 stuff only to check that the input really is a module. You could either drop that test (and insert it as soon as Sage 5.0 is available), or strengthen the test: After all, what you really want is that the given module is in fact a polynomial ring. So, you could use the functions is_PolynomialRing (or is_MPolynomialRing, if you also work with the multivariate case) to verify the input. Note that there is a deprecation warning if you use these functions in an interactive session. To avoid the warning, import it explicitly: sage: from sage.rings.polynomial.polynomial_ring import is_PolynomialRing sage: P.<x> = QQ[] sage: is_PolynomialRing(P) True Cheers, Simon -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
