Related papers: On Flat Polyhedra deriving from Alexandrov's Theor…
We show that 3-dimensional polyhedral manifolds with nonnegative curvature in the sense of Alexandrov can be approximated by nonnegatively curved 3-dimensional Riemannian manifolds.
For a polygon P with n vertices, the vertex guarding problem asks for the minimum subset G of P's vertices such that every point in P is seen by at least one point in G. This problem is NP-complete and APX-hard. The first approximation…
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform over a…
In this paper, we prove Gromov's flat corner domination conjecture in all dimensions. As a consequence, we answer positively the Stoker conjecture for convex Euclidean polyhedra in all dimensions. By applying the same techniques, we also…
We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for…
Let R be a local Artin ring with residue field k of positive characteristic. We prove that every finite flat group scheme over R whose special fiber belongs to a certain explicit family of non-commutative k-group schemes is killed by its…
We show that closed surfaces with minimal total absolute curvature in Cartan-Hadamard 3-manifolds bound flat convex bodies. This generalizes Chern-Lashof's theorem for surfaces in Euclidean space and solves a problem posed by Gromov in…
The purpose of this paper is to give an application of the gluing theorem for special Lagrangian submanifolds of a Calabi-Yau 3-fold. We proved a gluing theorem before to smooth a codimension-two singularity of a particular special…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
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…
It is shown that any smooth strictly convex global solution of $$\det(\frac{\partial^{2}u}{\partial \xi_{i}\partial \xi_{j}}) = \exp \left\{-\sum_{i=1}^n d_i \frac{\partial u}{\partial \xi_{i}} - d_0\right\},$$ where $d_0$, $d_1$,...,$d_n$…
We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the…
A sharp version of the Central Limit Theorem for linear combinations of iterates of an inner function is proved. The authors previously showed this result assuming a suboptimal condition on the coefficients of the linear combination. Here…
We prove that Alexandrov's conjecture relating the area and diameter of a convex surface holds for the surface of a general ellipsoid. This is a direct consequence of a more general result which estimates the deviation from the optimal…
We prove that any metric of non-positive curvature in the sense of Alexandrov on a compact surface can be isometrically embedded as a convex spacelike Cauchy surface in a flat spacetime of dimension (2+1). The proof follows from polyhedral…
In the paper, we give rigidity theorems when the glued space of two Alexandrov spapces with curvature bounded below is a suspension, cone or join. And we list some basic properties of joins in Appendix.
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…