Hi List, I recognized some differences between polyhedron and lattice polytopes. let p be a polyhedron, and l a lattice polytop. then:
first one: p.vertices() gives a list of lists, i.e. a list of vertices l.vertices() gives a matrix, where the columns define the vertices. second: let l be given, then p = Polyhedron(l.vertices().columns()) p.lattice_polytope() == l evaluates to false because the order of the vertices in p.lattice_polytope() is different then the one of the vertices in l third: for lattice polytopes we have nvertices, npoints and nfacets but for polyhedrons we have n_facets, n_vertices and more, which are not needed for lattice polytopes: n_rays, n_Hrepresentation, n_Vrepresentation, n_equations, n_inequalities, n_lines greatz Johannes -- 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.
