sage: Kx.<x,y>=QQ[] sage: I=Ideal([x*y]) sage: gb=I.groebner_basis(algorithm='singular:stdfglm')
TypeError: Singular error: ? The ideal i has to be 0-dimensional I believe computing the dimension of ideal requires computing groebner basis and even if this a false, computing the dimension of ideal will detect the constant ideal. If computing the dimension of ideal is efficient, this will be a major achievement. So `stdfglm` recognizes the ideal is not 0 dimensional, something else did the heavy computation of the dimension, so `stdfglm` is slower than the `else`. Is the above reasoning correct? Does the documentation address this? -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/CAGUWgD_rFT8kanBZkhQSnD5GyqmLesiK%2B__yfG4xnwmHq_iuNA%40mail.gmail.com.
