Some time ago I had some computations on ideals in Laurent polynomial rings, namely looking for minimal associated primes. Basically, I converted any generator into a polynomial, study the ideal in the polynomial ring, and forget the prime ideals containing monomials. From some time ago, it is much easier since it can be done directly in the ring of Laurent polynomials. Yesterday these computations on an ideal with 80 generators were really slow, but for some reason I checked that if the generators were converted to elements in the associated polynomial ring, and then the ideal in the Laurent polynomial ring is constructed, then those computations were solved really fast. I checked the code but I was not able to isolate the reason. Best, Enrique.
-- 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/e7f232a3-99ee-4dd4-baf4-f5a16d5b813fn%40googlegroups.com.
