Singular Manual: latticeCodegree

  | #### D.16.2.23 latticeCodegree `Syntax:` `Polymake::latticeCodegree(` polytope p `)` `Type:` int `Purpose:` getDimension(p)+1-latticeDegree(p), which is the smallest number k such that k*p has an interior lattice point. `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);
        Polymake::latticeCodegree(p);
      ==> polymake: used package cdd
      ==>   cddlib
      ==>   Implementation of the double description method of Motzkin et al.
      ==>   Copyright by Komei Fukuda.
      ==>   http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html
      ==>
      ==> 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);
        Polymake::latticeCodegree(q);
      ==> 4

User manual for Singular version 4-0-3p3, 2016, generated by texi2html.