2,643 research outputs found
Primitive Zonotopes
We introduce and study a family of polytopes which can be seen as a
generalization of the permutahedron of type . We highlight connections
with the largest possible diameter of the convex hull of a set of points in
dimension whose coordinates are integers between and , and with the
computational complexity of multicriteria matroid optimization.Comment: The title was slightly modified, and the determination of the
computational complexity of multicriteria matroid optimization was adde
Minimizing the number of lattice points in a translated polygon
The parametric lattice-point counting problem is as follows: Given an integer
matrix , compute an explicit formula parameterized by that determines the number of integer points in the polyhedron . In the last decade, this counting problem has received
considerable attention in the literature. Several variants of Barvinok's
algorithm have been shown to solve this problem in polynomial time if the
number of columns of is fixed.
Central to our investigation is the following question: Can one also
efficiently determine a parameter such that the number of integer points in
is minimized? Here, the parameter can be chosen
from a given polyhedron .
Our main result is a proof that finding such a minimizing parameter is
-hard, even in dimension 2 and even if the parametrization reflects a
translation of a 2-dimensional convex polygon. This result is established via a
relationship of this problem to arithmetic progressions and simultaneous
Diophantine approximation.
On the positive side we show that in dimension 2 there exists a polynomial
time algorithm for each fixed that either determines a minimizing
translation or asserts that any translation contains at most times
the minimal number of lattice points
Shapes of polyhedra and triangulations of the sphere
The space of shapes of a polyhedron with given total angles less than 2\pi at
each of its n vertices has a Kaehler metric, locally isometric to complex
hyperbolic space CH^{n-3}. The metric is not complete: collisions between
vertices take place a finite distance from a nonsingular point. The metric
completion is a complex hyperbolic cone-manifold. In some interesting special
cases, the metric completion is an orbifold. The concrete description of these
spaces of shapes gives information about the combinatorial classification of
triangulations of the sphere with no more than 6 triangles at a vertex.Comment: 39 pages. Published copy, also available at
http://www.maths.warwick.ac.uk/gt/GTMon1/paper25.abs.htm
- …