Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > 7ebd25ac536d248d499a3ce2acda963a > files > 5757

Macaulay2-1.3.1-8.fc15.i686.rpm

<?xml version="1.0" encoding="utf-8" ?>  <!-- for emacs: -*- coding: utf-8 -*- -->
<!-- Apache may like this line in the file .htaccess: AddCharset utf-8 .html -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN"	 "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg-flat.dtd" >
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head><title>ehrhart -- calculates the Ehrhart polynomial of a polytope</title>
<link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/>
</head>
<body>
<table class="buttons">
  <tr>
    <td><div><a href="_empty__Polyhedron.html">next</a> | <a href="_dual__Face__Lattice_lp__Z__Z_cm__Polyhedron_rp.html">previous</a> | <a href="_empty__Polyhedron.html">forward</a> | <a href="_dual__Face__Lattice_lp__Z__Z_cm__Polyhedron_rp.html">backward</a> | up | <a href="index.html">top</a> | <a href="master.html">index</a> | <a href="toc.html">toc</a> | <a href="http://www.math.uiuc.edu/Macaulay2/">Macaulay2 web site</a></div>

    </td>
  </tr>
</table>
<hr/>
<div><h1>ehrhart -- calculates the Ehrhart polynomial of a polytope</h1>
<div class="single"><h2>Synopsis</h2>
<ul><li><div class="list"><dl class="element"><dt class="heading">Usage: </dt><dd class="value"><div><tt>f = ehrhart P</tt></div>
</dd></dl>
</div>
</li>
<li><div class="single">Inputs:<ul><li><span><tt>P</tt>, <span>a <a href="___Polyhedron.html">convex polyhedron</a></span>, which must be compact</span></li>
</ul>
</div>
</li>
<li><div class="single">Outputs:<ul><li><span><tt>f</tt>, <span>a <a href="../../Macaulay2Doc/html/___Ring__Element.html">ring element</a></span>, Ehrhart polynomial as element of QQ[x]</span></li>
</ul>
</div>
</li>
</ul>
</div>
<div class="single"><h2>Description</h2>
<div><p/>
<tt>ehrhart</tt> can only be applied to polytopes, i.e. compact polyhedra. 
 To calculate the Ehrhart polynomial, the number of lattice points in the first n 
 dilations of the polytope are calculated, where n is the dimension of the polytope. 
 A system of linear equations is then solved to find the polynomial.<table class="examples"><tr><td><pre>i1 : P = convexHull transpose matrix {{0,0,0},{1,0,0},{0,1,0},{1,1,3}}

o1 = {ambient dimension => 3           }
      dimension of lineality space => 0
      dimension of polyhedron => 3
      number of facets => 4
      number of rays => 0
      number of vertices => 4

o1 : Polyhedron</pre>
</td></tr>
<tr><td><pre>i2 : ehrhart P

     1 3    2   3
o2 = -x  + x  + -x + 1
     2          2

o2 : QQ[x]</pre>
</td></tr>
</table>
</div>
</div>
<div class="waystouse"><h2>Ways to use <tt>ehrhart</tt> :</h2>
<ul><li>ehrhart(Polyhedron)</li>
</ul>
</div>
</div>
</body>
</html>