Related papers: Recognition of affine-equivalent polyhedra by thei…

In 1970, Coxeter gave a short and elegant geometric proof showing that if $p_1, p_2, \ldots, p_n$ are vertices of an $n$-gon $P$ in cyclic order, then $P$ is affinely regular if, and only if there is some $\lambda \geq 0$ such that…

A Coxeter system is called two-dimensional if its associated Davis complex is two-dimensional (equivalently, every spherical subgroup has rank less than or equal to 2). We prove that given a two-dimensional system (W,S) and any other system…

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

We study the Cauchy problem for a class of third order linear anisotropic evolution equations with complex valued lower order terms depending both on time and space variables. Under suitable decay assumptions for $|x| \to \infty$ on these…

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…

Let $P \subset \R^3$ be a polyhedron. It was conjectured that if $P$ is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. $P$ can be triangulated without adding new vertices), then it…

We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…

We classify smooth surfaces whose higher cohomologies of i-forms for all i vanish. We show that if such a surface is not affine, then it has essentially two possibilities.

The classical Liouville Theorem on conformal transformations determines local conformal transformations on the Euclidean space of dimension $\geq 3$. Its natural adaptation to the general framework of Riemannian structures is the 2-rigidity…

Let $\ast$ and $\widetilde {\ast}$ denote the convolution of two analytic maps and that of an analytic map and a harmonic map respectively. Pokhrel [1] proved that if $f = h+\overline{g}$ is a harmonic map convex in the direction of…

The monostatic property of polyhedra (i.e. the property of having just one stable or unstable static equilibrium point) has been in a focus of research ever since Conway and Guy \cite{Conway} published the proof of the existence of the…

We survey the symmetry preserving properties for the dual propinquity, under natural non-degeneracy and equicontinuity conditions. These properties are best formulated using the notion of the covariant propinquity when the symmetries are…

A stability version of the Blaschke-Santal\'o inequality and the affine isoperimetric inequality for convex bodies of dimension n>2 is proved. The first step is the reduction to the case when the convex body is o-symmetric and has axial…

A plane curve C defined by a homogeneous polynomial satisfying Laplace's equation appears canonically as the vanishing of the Pfaffian of a skew-symmetric matrix of linear forms. As a consequence there is a natural semi-stable rank two…

In 1996 I.Kh. Sabitov proved that the volume of a simplicial polyhedron in a 3-dimensional Euclidean space is a root of certain polynomial with coefficients depending on the combinatorial type and on edge lengths of the polyhedron only.…

The aim of this note is to present two results that make the task of finding equivalent polyhedral norms on certain Banach spaces, having either a Schauder basis or an uncountable unconditional basis, easier and more transparent. The…

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…