Related papers: On Flat Polyhedra deriving from Alexandrov's Theor…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
We prove that every flat nonlinear discrete-time system can be decomposed by coordinate transformations into a smaller-dimensional subsystem and an endogenous dynamic feedback. For flat continuous-time systems, no comparable result is…
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…
We show that the max-min-angle polygon in a planar point set can be found in time $O(n\log n)$ and a max-min-solid-angle convex polyhedron in a three-dimensional point set can be found in time $O(n^2)$. We also study the maxmin-angle…
Two basic theorems of the theory of flexible polyhedra were proven by completely different methods: R. Alexander used analysis, namely, the Stokes theorem, to prove that the total mean curvature remains constant during the flex, while I.Kh.…
In this paper we develop a pure algebraic method which provides an algorithm for testing emptyness of a polyhedron.
We present approximation algorithms with O(n^3) processing time for the minimum vertex and edge guard problems in simple polygons. It is improved from previous O(n^4) time algorithms of Ghosh. For simple polygon, there are O(n^3) visibility…
We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…
Our goal is to show the beauty and power of Alexandrov geometry by reaching interesting applications and theorems with a minimum of preparation. The topics include 1. Reshetnyak's gluing theorem, 2. Estimates on the number of collisions in…
A parallelohedron is called reducible, if it can be represented as a direct product of two parallelohedra of lower dimension. In his Ph.D. thesis (2005) the first author proved a criterion of reducibility of a parallelohedron in terms of…
In this note we prove the Borel Conjecture for closed, irreducible and sufficiently collapsed three-dimensional Alexandrov spaces. We also pose several questions related to characterization of fundamental groups of three-dimensional…
In this paper, we study the following problem of reconstructing a simple polygon: Given a cyclically ordered vertex sequence of an unknown simple polygon P of n vertices and, for each vertex v of P, the sequence of angles defined by all the…
A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…
We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method of determining the graph structure of the polyhedra from a…
The purpose of this paper is to prove a gluing theorem for a given special Lagrangian submanifold of a Calabi-Yau 3-fold. The proof will be an adaption of the gluing techniques in J-holomorphic curve theory. It is a well known procedure in…
We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…
We propose a method to prove a polyhedral branching formula for Kirillov-Reshetikhin (KR) modules over a quantum affine algebra. When the underlying simple Lie algebra is of exceptional type, such a formula remains conjectural in many…
Visibility graph of a simple polygon is a graph with the same vertex set in which there is an edge between a pair of vertices if and only if the segment through them lies completely inside the polygon. Each pair of adjacent vertices on the…
We give a combinatorial proof of a theorem first proved by Souto which says the following. Let M_1 and M_2 be simple 3-manifolds with connected boundary of genus g>0. If M_1 and M_2 are glued via a complicated map, then every minimal…
Casting is a manufacturing process where liquid material is poured into a mold having the shape of a desired product. After the material solidifies, the product is removed from the mold. We study the case where the mold is made of a single…