English
Related papers

Related papers: Strong convexity in flip-graphs

200 papers

We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…

Combinatorics · Mathematics 2021-07-09 James Cruickshank , Eleftherios Kastis , Derek Kitson , Bernd Schulze

Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…

Computational Geometry · Computer Science 2017-11-21 Oswin Aichholzer , Wolfgang Mulzer , Alexander Pilz

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

Metric Geometry · Mathematics 2019-03-01 Nicholas Barvinok , Mohammad Ghomi

Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topologically open) polygon $C$ and a finite set $P$ of points in…

Computational Geometry · Computer Science 2016-09-02 Steven Chaplick , Fabian Lipp , Ji-won Park , Alexander Wolff

Surfaces of finite geometric type are complete, immersed into the tree-dimensional Euclidean space with finite total curvature and Gauss map extending to an oriented compact surface as a smooth branched covering map over the unit sphere of…

Differential Geometry · Mathematics 2019-06-24 Nícolas A. de Andrade , Luquesio P. Jorge

We prove that, if a closed geodesic $\Gamma$ on a complete finite type hyperbolic surface has at least 2 self-intersections, then the length of $\Gamma$ has an lower bound $2\log(5+2\sqrt6)$, and the lower bound is sharp, attained on a…

Geometric Topology · Mathematics 2025-10-02 Wujie Shen

Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every $2$-arc lies in a unique quadrangle. A graph $\Gamma$ is locally rank 3 if there exists $G\leq…

Group Theory · Mathematics 2015-12-08 John Bamberg , Alice Devillers , Joanna B. Fawcett , Cheryl E. Praeger

Let $M$ be a closed hyperbolic 3-manifold with a fibered face $\sigma$ of the unit ball of the Thurston norm on $H_2(M)$. If $M$ satisfies a certain condition related to Agol's veering triangulations, we construct a taut branched surface in…

Geometric Topology · Mathematics 2018-03-16 Michael Landry

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

Computational Geometry · Computer Science 2015-07-16 David Eppstein

We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…

Geometric Topology · Mathematics 2021-12-15 Erica Flapan , Song Yu

We investigate properties of sparse and tight surface graphs. In particular we derive topological inductive constructions for $(2, 2)$-tight surface graphs in the case of the sphere, the plane, the twice punctured sphere and the torus. In…

Combinatorics · Mathematics 2021-03-09 James Cruickshank , Derek Kitson , Stephen C. Power , Qays Shakir

A curve $\gamma$ in a Riemannian manifold $M$ is three-dimensional if its torsion (signed second curvature function) is well-defined and all higher-order curvatures vanish identically. In particular, when $\gamma$ lies on an oriented…

Differential Geometry · Mathematics 2023-08-25 Matteo Raffaelli

A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.

Combinatorics · Mathematics 2014-07-14 Dipendu Maity , Ashish Kumar Upadhyay

Although the strong embedding of a 3-connected planar graph $G$ on the sphere is unique, $G$ can have different inequivalent strong embeddings on a surface of positive genus. If $G$ is cubic, then the strong embeddings of $G$ on the…

Combinatorics · Mathematics 2025-09-19 Meike Weiß , Reymond Akpanya , Alice C. Niemeyer

In this paper we prove a convexity and fibre-connectedness theorem for proper maps constructed by Thimm's trick on a connected Hamiltonian $G$-space $M$ that generate a Hamiltonian torus action on an open dense submanifold. Since these maps…

Symplectic Geometry · Mathematics 2021-10-06 Jeremy Lane

Gay and Kirby introduced trisections which describe any closed oriented smooth 4-manifold $X$ as a union of three four-dimensional handlebodies. A trisection is encoded in a diagram, namely three collections of curves in a closed oriented…

Geometric Topology · Mathematics 2021-06-21 Vincent Florens , Delphine Moussard

We show that for a very general and natural class of curvature functions, the problem of finding a complete strictly convex hypersurface satisfying f({\kappa}) = {\sigma} over (0,1) with a prescribed asymptotic boundary {\Gamma} at infinity…

Analysis of PDEs · Mathematics 2010-10-20 Bo Guan , Joel Spruck

For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…

Differential Geometry · Mathematics 2024-10-30 Herng Yi Cheng

In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…

Combinatorics · Mathematics 2015-09-28 Omid Amini , Louis Esperet , Jan van den Heuvel