Characterizations of reduced polytopes in finite-dimensional normed spaces.
Given a planar convex body B centered at the origin, we denote by ℳ ²(B) the Minkowski plane (i.e., two-dimensional linear normed space) with the unit ball B. For a triangle T in ℳ ²(B) we denote by the least possible radius of a Minkowskian ball enclosing T. We remark that in the terminology of location science is the optimum of the minimax location problem with distance induced by B and vertices of T as existing facilities (see, for instance, [HM03] and the references therein). Using methods...
In this paper we investigate the problem of finding an explicit element whose toric residue is equal to one. Such an element is shown to exist if and only if the associated polytopes are essential. We reduce the problem to finding a collection of partitions of the lattice points in the polytopes satisfying a certain combinatorial property. We use this description to solve the problem when and for any when the polytopes of the divisors share a complete flag of faces. The latter generalizes earlier...
Given a combinatorial description C of a polyhedron having E edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize C is generally not a convex subset of RE. If C has five or more faces, Andreev's Theorem states that the corresponding space of dihedral angles AC obtained by restricting to non-obtuse angles is a convex polytope. In this paper we explain why Andreev did not consider tetrahedra, the only polyhedra having fewer than five faces, by demonstrating that the...