Related papers: A Pseudopolynomial Algorithm for Alexandrov's Theo…

It is proved the generalization of Toponogov theorem about the length of the curve in two-dimensional Riemannian manifolds in the case of two-dimensional Alexandrov spaces.

In this thesis we develop a novel framework to study smooth and strongly convex optimization algorithms, both deterministic and stochastic. Focusing on quadratic functions we are able to examine optimization algorithms as a recursive…

In the Euclidean setting, the well-known Alexandrov theorem states that convex functions are twice differentiable almost everywhere. In this note, we extend this theorem to rank-one convex functions. Our approach is novel in that it draws…

Every surface that is intrinsically polyhedral can be represented by a portalgon: a collection of polygons in the Euclidean plane with some pairs of equally long edges abstractly identified. While this representation is arguably simpler…

A Fuchsian polyhedron in hyperbolic space is a polyhedral surface invariant under the action of a Fuchsian group of isometries (i.e. a group of isometries leaving globally invariant a totally geodesic surface, on which it acts cocompactly).…

A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most $\pi$ on both sides. While the existence of a simple closed quasigeodesic on a convex…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

We say a map f:X \to Y is an \epsilon-embedding if it is continuous and the diameter of the fibres is less than \epsilon. This type of maps is used in the notion of Urysohn width (sometimes referred to as Alexandrov width), a_n(X). It is…

Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a…

We describe a framework for bounding extreme values of quantities on global attractors of differential dynamical systems. A global attractor is the minimal set that attracts all bounded sets; it contains all forward-time limit points. Our…

We present the first polynomial time approximation algorithm for computing shortest paths in weighted three-dimensional domains. Given a polyhedral domain $\D$, consisting of $n$ tetrahedra with positive weights, and a real number…

A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron…

We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…

The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…

Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input…

We devise a polynomial-time approximation scheme for the classical geometric problem of finding an approximate short path amid weighted regions. In this problem, a triangulated region P comprising of n vertices, a positive weight associated…

We prove a Lipschitz-Volume rigidity theorem in Alexandrov geometry, that is, if a 1-Lipschitz map $f\colon X=\amalg X_\ell\to Y$ between Alexandrov spaces preserves volume, then it is a path isometry and an isometry when restricted to the…

In this paper we discuss the sufficient and necessary conditions for multiple Alexandrov spaces being glued to an Alexandrov space. We propose a Gluing Conjecture, which says that the finite gluing of Alexandrov spaces is an Alexandrov…

In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…

Describing the equality conditions of the Alexandrov--Fenchel inequality has been a major open problem for decades. We prove that in the case of convex polytopes, this description is not in the polynomial hierarchy unless the polynomial…