The question remains: Do we want the change proposed in https://trac.sagemath.org/ticket/27364 fixing the mentioned issue (but introducing a slowdown) or not?
(I somehow tend to say "we want that", because the change obviously fixes a bug. (It seems natural that the MPoly functor returns a MPoly ring in all cases and that > sage: T = PolynomialRing(QQ, 't', 1); t = T.gen(); T > sage: F, R = T.construction() > sage: F(R) is T > True is satisfied. Daniel -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
