Corrected a link and added Ehrhart poly

sagemath · Mar 20, 2017 · 79bb4ce · 79bb4ce
1 parent 46f48fa
commit 79bb4ce
Show file tree

Hide file tree

Showing 2 changed files with 14 additions and 1 deletion.
diff --git a/src/doc/en/thematic_tutorials/geometry/is_this_polyhedron.rst b/src/doc/en/thematic_tutorials/geometry/is_this_polyhedron.rst
@@ -87,7 +87,7 @@ Reference manual: :meth:`sage.geometry.polyhedron.base.Polyhedron_base.is_neighb
 This functions checks if the polar of a lattice polytope is also a lattice
 polytope.
 
-Reference manual: :meth:`sage.geometry.polyhedron.base.Polyhedron_base_ZZ.is_reflexive`
+Reference manual: :meth:`sage.geometry.polyhedron.base_ZZ.Polyhedron_ZZ.is_reflexive`
 
 ... simple? (Aren't they all?)
 ==============================================================

diff --git a/src/doc/en/thematic_tutorials/geometry/related_objects.rst b/src/doc/en/thematic_tutorials/geometry/related_objects.rst
@@ -198,6 +198,19 @@ Testing if a polyhedron contains a point is done as follows.
 
 .. end of output
 
+Ehrhart polynomial
+--------------------------------------------------------------
+
+The Ehrhart polynomial can be computed using the :code:`latte_int` package.
+
+::
+
+    sage: Cube = polytopes.cube()
+    sage: Cube.ehrhart_polynomial()  # optional - latte_int
+    8*t^3 + 12*t^2 + 6*t + 1
+
+.. end of output
+
 Face and Normal fans
 --------------------------------------------------------------