Thanks for the quick response. My question is somewhat different. Specifically, I have a set of equations that define each facet of some polytope. The intersection of all these equations forms a lattice polytope (finite and bounded). I want to know if that polytope is convex or not. If it helps to think of a specific scenario: I'm working with tops of reflexive polytopes. One question that I'm interested is what results when we take the union of two tops. One obvious question to ask is whether it's convex or not. Thanks,
Dmitri On Feb 21, 4:48 pm, Volker Braun <vbraun.n...@gmail.com> wrote: > Polyhedron and Polytope (=compact Polyhedron) implies convex. For example: > > sage: lp = LatticePolytope(matrix([[-1,-1], [-1,0], [0,0], [1,0], > [1,-1]]).transpose()) > sage: lp.points() > [-1 -1 1 1 0 0] > [-1 0 0 -1 -1 0] > sage: lp.vertices() > [-1 -1 1 1] > [-1 0 0 -1] -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
