> Ok, I'll have a look at frobby! Just to check, I installed Macaulay2 and > did the same computation and it gave me the right answer... >
CoCoA might also compute the correct answer, as I believe CoCoA switches silently to bigint whenever it notices the need. I don't think Sage supports CoCoA anymore though. (I'd like to fix that one day, but there are lots of things I'd like to do one day...) > So I could interface my code, but this is not the optimal way. If it is a > bug, it should be looked at and repaired... > I'm willing to be corrected here, but my reaction is that this is "not a bug." Sage uses Singular as its commutative algebra engine, and Singular advertises this limitation. As an analogy, it's not a bug if a computer algebra system that cautions users that it works only modulo a prime p gives you 1-2=p-1 instead of -1. That doesn't mean we can't address it. Hilbert series & polynomials work with int, so maybe a workaround would be to check output from Singular, and see if 2^32 divides it; if so, cancel the corresponding term. I don't know if we can guarantee that this is always correct. Alternately, we can ask upstream. john perry -- 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 http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
