| #### D.13.2.40 latticeCodegree Procedure from library `polymake.lib` (see polymake_lib). Usage: latticeCodegree(p); p polytope Return: int, the smalles number n such that n*p has a relative interior lattice point Note: dimension(p)+1==latticeDegree(p)+latticeCodegree(p) Example:
    LIB "polymake.lib";
    ==> Welcome to polymake version
    ==> Copyright (c) 1997-2015
    ==> Ewgenij Gawrilow, Michael Joswig (TU Darmstadt)
    ==> http://www.polymake.org
    intmat M[4][3]=
    1,1,0,
    1,1,1,
    1,0,1,
    1,0,0;
    polytope p = polytopeViaPoints(M);
    latticeCodegree(p);
    ==> polymake: used package ppl
    ==>   The Parma Polyhedra Library (PPL): A C++ library for convex polyhedra
    ==>   and other numerical abstractions.
    ==>   http://www.cs.unipr.it/ppl/
    ==>
    ==> 2
    intmat N[4][4]=
    1,1,0,0,
    1,0,1,0,
    1,0,0,1,
    1,0,0,0;
    polytope q = polytopeViaPoints(N);
    latticeCodegree(q);
    ==> 4

User manual for Singular version 4-1-0p2, 2017, generated by texi2html.