You might find this useful: https://stackoverflow.com/questions/3323001/what-is-the-maximum-recursion-depth-in-python-and-how-to-increase-it
Best, Travis On Tuesday, August 28, 2018 at 7:56:01 PM UTC+10, Simon King wrote: > > Hi! > > A part of my current project involves the computation of the Hilbert > Poincaré series of a monomial ideal in a polynomial ring with degree > weights on the generators. > > Good: Singular can compute it in principle. > Bad: In some of my examples, the coefficients are big, and so Singular > gives up and raises an int overflow. > > Good: When I implemented the algorithm outlined in chapter 5 of "A > Singular introduction to commutative algebra" [Greuel and Pfister] in > Sage, I was able to compute some of the bigint examples. > Bad: In other examples, the algorithm exceeds the permitted recursion > depth. > > Good: There are strategies to reduce the recursion depth of the > algorithm by doing more careful choices in some places -- see for > example "Computation of Hilbert-Poincaré series" by Anna Bigatti (J. > Pure and Applied Algebra 119, 237-253, 1997). > Bad: I'd prefer not to implement it myself, if possible. > > So, the question is: Can I avoid to implement it myself? Can you point > me to something in Sage that can compute Hilbert Poincaré series better > than Singular? > > Best regards, > Simon > > -- 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.
