Related papers: A rigidity criterion for non-convex polyhedra

Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss…

We consider the problem of motion of several rigid bodies immersed in a perfect compressible fluid. Using the method of convex integration we establish the existence of infinitely many weak solutions with {\it a priori} prescribed motion of…

We consider systems of linear partial differential equations, which contain only second and first derivatives in the $x$ variables and which are uniformly parabolic in the sense of Petrovski\v{\i} in the layer ${\mathbb R}^n\times [0,T]$.…

We show a local rigidity result for the integrability of symplectic billiards. We prove that any domain which is close to an ellipse, and for which the symplectic billiard map is rationally integrable must be an ellipse as well. This is in…

This paper is devoted to rigidity results for some elliptic PDEs and related interpolation inequalities of Sobolev type on smooth compact connected Riemannian manifolds without boundaries. Rigidity means that the PDE has no other solution…

We define \emph{piecewise rank 1} manifolds, which are aspherical manifolds that generally do not admit a nonpositively curved metric but can be decomposed into pieces that are diffeomorphic to finite volume, irreducible, locally symmetric,…

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Axisymmetric, rigidly rotating polytropes are considered in the framework of both the original Chandrasekhar (C33) approximation and a different version (extended C33 approximation). Special effort is devoted to two specific points, namely…

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Let $M$ be a compact orientable 3-manifold with hyperbolizable interior and non-empty boundary such that all boundary components have genii at least 2. We study an Alexandrov-Weyl-type problem for convex hyperbolic cone-metrics on $\partial…

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…

A negatively curved hyperbolic cone metric is called rigid if it is determined (up to isotopy) by the support of its Liouville current, and flexible otherwise. We provide a complete characterization of rigidity and flexibility, prove that…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Here we propose a class of frameworks in the plane, braced polygons, that may be globally rigid and are analogous to convex polyopes in 3 space that are rigid by Cauchy's rigidity Theorem in 1813.

We introduce the fatness parameter of a 4-dimensional polytope P, defined as \phi(P)=(f_1+f_2)/(f_0+f_3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4-polytopes bounded? We…

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…