Volker Braun <vbraun.n...@gmail.com> writes: > Hi Martin,
Wow, many thanks for the quick answer! > PALP has various compile-time limits. You can increase POLY_Dmax in > the PALP sources but you are likely to hit another limit if your > problem is this large. Indeed... :-( > Also, PALP typically does not do any checking so you'll get wrong > answers. > I wrote a Cython implementation of the naive point counting algorithm > which is in Sage-5.0.rc (don't remember exactly when it was merged). I > suggest you use that: > > sage: simplex = Polyhedron([(1,2,3), (2,3,7), (-2,-3,-11)]) > sage: simplex.integral_points() > ((-2, -3, -11), (0, 0, -2), (1, 2, 3), (2, 3, 7)) does this mean, if I install sage-5.0xxx I automatically get your new algorithm? I only hope I can install it, there doesn't seem to be a precompiled package around, is there? thanks again, Martin -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
