中文
相关论文

相关论文: Simplification paths in the Pachner graphs of clos…

200 篇论文

A triangulation of a compact 3-manifold is annular-efficient if it is 0-efficient and the only normal, incompressible annuli are thin edge-linking. If a compact 3-manifold has an annular-efficient triangulation, then it is irreducible,…

几何拓扑 · 数学 2011-08-16 William Jaco , J. Hyam Rubinstein

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

计算几何 · 计算机科学 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

We prove that every cusped hyperbolic 3-manifold has a finite cover admitting infinitely many geometric ideal triangulations. Furthermore, every long Dehn filling of one cusp in this cover admits infinitely many geometric ideal…

几何拓扑 · 数学 2022-11-22 David Futer , Emily Hamilton , Neil R. Hoffman

In this thesis, we study two different graph problems. The first problem revolves around geometric spanners. Here, we have a set of points in the plane and we want to connect them with straight line segments, such that there is a path…

计算几何 · 计算机科学 2015-09-10 Sander Verdonschot

Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…

广义相对论与量子宇宙学 · 物理学 2024-01-03 Lee Lindblom , Oliver Rinne

For a 3-dimensional manifold $M^3$, its complexity $c(M^3)$, introduced by S.Matveev, is the minimal number of vertices of an almost simple spine of $M^3$; in many cases it is equal to the minimal number of tetrahedra in a singular…

几何拓扑 · 数学 2007-05-23 Sergei Anisov

After surveying existing proofs that every closed, orientable 3-manifold is parallelizable, we give three proofs using minimal background. In particular, our proofs use neither spin structures nor the theory of Stiefel-Whitney classes.

几何拓扑 · 数学 2018-08-07 Riccardo Benedetti , Paolo Lisca

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…

几何拓扑 · 数学 2015-06-02 Basudeb Datta

The class of 2-dimensional non-integrable flat dynamical systems has a rather extensive literature with many deep results, but the methods developed for this type of problems, both the traditional approach via Teichm\"{u}ller geometry and…

动力系统 · 数学 2024-05-30 J. Beck , W. W. L. Chen , Y. Yang

Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following…

几何拓扑 · 数学 2011-05-13 Evgeny Fominykh , Bruno Martelli

This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…

微分几何 · 数学 2012-05-22 Daniel J. Pons

We provide an algorithm to determine the Heegaard genus of simple 3-manifolds with non-empty boundary. More generally, we supply an algorithm to determine (up to ambient isotopy) all the Heegaard splittings of any given genus for the…

几何拓扑 · 数学 2016-01-20 Marc Lackenby

In this paper, we discuss how to design the graph topology to reduce the communication complexity of certain algorithms for decentralized optimization. Our goal is to minimize the total communication needed to achieve a prescribed accuracy.…

最优化与控制 · 数学 2016-12-06 Yat-Tin Chow , Wei Shi , Tianyu Wu , Wotao Yin

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

计算几何 · 计算机科学 2016-11-02 Mirela Damian , Erik Demaine , Robin Flatland , Joseph O'Rourke

Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly important problem in computational topology. A key difficulty for enumeration algorithms is that most combinatorial triangulations must be discarded…

几何拓扑 · 数学 2015-03-17 Benjamin A. Burton

We classify the $3$-manifolds obtained as the preimages of arcs on the plane for simplified $(2, 0)$-trisection maps, which we call vertical $3$-manifolds. Such a $3$-manifold is a connected sum of a $6$-tuple of vertical $3$-manifolds over…

几何拓扑 · 数学 2020-10-19 Nobutaka Asano

Given an ideal triangulation of a connected 3-manifold with non-empty boundary consisting of a disjoint union of tori, a point of the deformation variety is an assignment of complex numbers to the dihedral angles of the tetrahedra subject…

几何拓扑 · 数学 2016-01-20 Henry Segerman

It is known since 1954 that every 3-manifold bounds a 4-manifold. Thus, for instance, every 3-manifold has a surgery diagram. There are several proofs of this fact, including constructive proofs, but there has been little attention to the…

几何拓扑 · 数学 2010-03-15 Francesco Costantino , Dylan P. Thurston

One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor…

量子物理 · 物理学 2016-10-17 Gorjan Alagic , Edgar A. Bering

We introduce a notion of cross-flips: local moves that transform a balanced (i.e., properly $(d+1)$-colored) triangulation of a combinatorial $d$-manifold into another balanced triangulation. These moves form a natural analog of bistellar…

组合数学 · 数学 2017-08-31 Ivan Izmestiev , Steven Klee , Isabella Novik