Rigidity and polynomial invariants of convex polytopes

More by Maksym Fedorchuk

More by Igor Pak

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the
full text of this article because we are not able to identify you as
a subscriber. If you have a personal subscription to this journal,
then please login. If you are already logged in, then you may need
to update your profile to register your subscription. Read more about accessing full-text

Abstract

We present an algebraic approach to the classical problem of constructing a simplicial convex polytope given its planar triangulation and lengths of its edges. We introduce polynomial invariants of a polytope and show that they satisfy polynomial relations in terms of squares of edge lengths. We obtain sharp upper and lower bounds on the degree of these polynomial relations. In a special case of regular bipyramid we obtain explicit formulae for some of these relations. We conclude with a proof of the Robbins conjecture on the degree of generalized Heron polynomials.