Related papers: On Flat Polyhedra deriving from Alexandrov's Theor…
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 application of linear…
We study the problem of decomposing (i.e. partitioning and covering) polygons into components that are $\alpha$-fat, which means that the aspect ratio of each subpolygon is at most $\alpha$. We consider decompositions without Steiner…
In 1959, Klee proved that a convex body $K$ is a polyhedron if and only if all of its projections are polygons. In this paper, a new proof of this theorem is given for convex bodies in $\mathbb{R}^3$.
We show that a realization of a closed connected PL-manifold of dimension n-1 in Euclidean n-space (n>2) is the boundary of a convex polyhedron if and only if the interior of each (n-3)-face has a point, which has a neighborhood lying on…
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…
In the 1960s Arnold conjectured that a Hamiltonian diffeomorphism of a closed connected symplectic manifold $(M,\omega)$ should have at least as many contractible fixed points as a smooth function on $M$ has critical points. Such a…
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…
In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…
In the classical linear degeneracy testing problem, we are given $n$ real numbers and a $k$-variate linear polynomial $F$, for some constant $k$, and have to determine whether there exist $k$ numbers $a_1,\ldots,a_k$ from the set such that…
Classical existence theorems and solution methods for quadratic programming traditionally rely on the analytical properties of real numbers, specifically compactness and completeness. These tools are unavailable in general linearly ordered…
In this paper, we give a comparison version of Pythagorean Theorem to judge the lower or upper bound of the curvature of Alexandrov spaces (including Riemannian manifolds).
In this paper we give a new proof for an almost isometry theorem in Alexandrov spaces with curvature bounded below.
In fivebrane compactifications on 3-manifolds, we point out the importance of all flat connections in the proper definition of the effective 3d N=2 theory. The Lagrangians of some theories with the desired properties can be constructed with…
Kirillov and Reshetikhin conjectured what is now known as the fermionic formula for the decomposition of tensor products of certain finite dimensional modules over quantum affine algebras. This formula can also be extended to the case of…
Let $E\subset \mathbb R^n$, $n\ge 2$, be a set of finite perimeter with $|E|=|B|$, where $B$ denotes the unit ball. When $n=2$, since convexification decreases perimeter (in the class of open connected sets), it is easy to prove the…
Using instanton Floer theory, extending methods due to Froyshov, we determine the definite lattices that arise from smooth 4-manifolds bounded by certain homology 3-spheres. For example, we show that for +1 surgery on the (2,5) torus knot,…
It is known that the Alexander polynomial detects fibered knots and 3-manifolds that fiber over the circle. In this note, we show that when the Alexander polynomial becomes inconclusive, the notion of "knot adjacency", studied in the paper…
Flatness of discrete-time systems can be characterized by two simple properties. There exists a map, a submersion, from the flat coordinates and their forward shifts to the state and the input of the discrete-time system, such that the…
Motivated by the study of a certain family of classical geometric problems we investigate the existence of multiplicative connections on proper Lie groupoids. We show that one can always deform a given connection which is only approximately…