Home Online Manual
Top
Back: isVeryAmple
Forward: latticeDegree
FastBack: gfanlib_so
FastForward: Release Notes
Up: polymake_so
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

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
==> Copyright (c) 1997-2012
==> 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 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 lrslib
==>   Implementation of the reverse search algorithm of Avis and Fukuda.
==>   Copyright by David Avis.
==>   http://cgm.cs.mcgill.ca/~avis/lrs.html
==> 
==> 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