English
Related papers

Related papers: On Flat Polyhedra deriving from Alexandrov's Theor…

200 papers

A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. (2012) by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show…

Computational Geometry · Computer Science 2019-05-21 Prosenjit Bose , Vida Dujmović , Nima Hoda , Pat Morin

Building on a classical solution to the pentagon equation, constructed earlier by the author and E.V. Martyushev and related to the flat geometry invariant under the group SL(2), we construct an algebraic complex corresponding to a…

Algebraic Topology · Mathematics 2009-11-10 I. G. Korepanov

Given an special type of triangulation $T$ for an oriented closed 3-manifold $M^3$ we produce a framed link in $S^3$ which induces the same $M^3$ by an algorithm of complexity $O(n^2)$ where $n$ is the number of tetrahedra in $T$ . The…

Geometric Topology · Mathematics 2013-02-21 Sóstenes Lins , Ricardo Machado

We extend basic results in $3$-manifold topology to general three-dimensional Alexandrov spaces (or Alexandrov $3$-spaces for short), providing a unified framework for manifold and non-manifold spaces. We generalize the connected sum to…

We define a plane curve to be threadable if it can rigidly pass through a point-hole in a line L without otherwise touching L. Threadable curves are in a sense generalizations of monotone curves. We have two main results. The first is a…

Computational Geometry · Computer Science 2018-03-26 Joseph O'Rourke , Emmely Rogers

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…

Combinatorics · Mathematics 2007-05-23 S. Gao , A. G. B. Lauder

A general method for the construction of smooth flat connections on 3-manifolds is introduced. The procedure is strictly connected with the deduction of the fundamental group of a manifold M by means of a Heegaard splitting presentation of…

High Energy Physics - Theory · Physics 2018-03-14 Enore Guadagnini , Philippe Mathieu , Frank Thuillier

The cyclohedron (Bott-Taubes polytope) arises both as the polyhedral realization of the poset of all cyclic bracketings of a circular word and as an essential part of the Fulton-MacPherson compactification of the configuration space of n…

Combinatorics · Mathematics 2008-11-11 Sinisa Vrecica , Rade Zivaljevic

Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…

Dynamical Systems · Mathematics 2026-05-04 Panjing Wu

Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests. We give a simple…

Data Structures and Algorithms · Computer Science 2012-02-23 Jens M. Schmidt

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

Geometric Topology · Mathematics 2016-09-07 Alexander Nabutovsky , Shmuel Weinberger

We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…

Geometric Topology · Mathematics 2016-08-16 Shane D'Mello , Rama Mishra

The Strong Exponential Time Hypothesis and the OV-conjecture are two popular hardness assumptions used to prove a plethora of lower bounds, especially in the realm of polynomial-time algorithms. The OV-conjecture in moderate dimension…

Computational Complexity · Computer Science 2018-05-23 Amir Abboud , Karl Bringmann , Holger Dell , Jesper Nederlof

Taubes' gluing theorems establish the existence of ASD connections on closed, oriented 4-manifolds. We extend these gluing results to the mASD connections of Morgan-Mrowka-Ruberman on oriented 4-manifolds with cylindrical ends. As a…

Differential Geometry · Mathematics 2023-03-28 David L. Duncan , Ian Hambleton

Let $Y$ be a closed $3$-manifold such that all flat $SU(2)$-connections on $Y$ are $non$-$degenerate$. In this article, we prove a Uhlenbeck-type compactness theorem on $Y$ for stable flat $SL(2,\mathbb{C})$ connections satisfying an…

Differential Geometry · Mathematics 2021-10-19 Teng Huang

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Rahul Shah , Xuancheng Shao , Ezra Winston

With the goal of solving optimisation problems on non-Riemannian manifolds, such as geometrical surfaces with sharp edges, we develop and prove the convergence of a forward-backward method in Alexandrov spaces with curvature bounded both…

Optimization and Control · Mathematics 2026-04-03 Heikki von Koch , Tuomo Valkonen

In this paper, we first prove the optimal lower bound for Alexandrov angle rigidity of torsion elliptic isometries on any complete CAT($\kappa$) space, which, when attained, leads to an embedded 2-flat in the tangent cone invariant under…

Metric Geometry · Mathematics 2014-04-01 Khek Lun Harold Chao

This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton…

Computational Geometry · Computer Science 2008-05-02 Gill Barequet , David Eppstein , Michael T. Goodrich , Amir Vaxman

We propose an efficient algorithm for matching two correlated Erd\H{o}s--R\'enyi graphs with $n$ vertices whose edges are correlated through a latent vertex correspondence. When the edge density $q= n^{- \alpha+o(1)}$ for a constant $\alpha…

Data Structures and Algorithms · Computer Science 2024-03-07 Jian Ding , Zhangsong Li