中文
相关论文

相关论文: Towards Lower Bounds for Complexity of 3-Manifolds…

200 篇论文

We study lower bounds for the number of vertices in a PL-triangulation of a given manifold $M$. While most of the previous estimates are based on the dimension and the connectivity of $M$, we show that further information can be extracted…

几何拓扑 · 数学 2018-01-17 Petar Pavešić

We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…

几何拓扑 · 数学 2014-02-06 Jiří Matoušek , Eric Sedgwick , Martin Tancer , Uli Wagner

In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the pairs we use a variation of Matveev's definition of complexity for…

几何拓扑 · 数学 2008-05-01 Damian Heard , Craig Hodgson , Bruno Martelli , Carlo Petronio

We define a new combinatorial class of triangulations of closed 3-manifolds, satisfying a weak version of 0-efficiency combined with a weak version of minimality, and study them using twisted squares. As an application, we obtain strong…

几何拓扑 · 数学 2015-12-23 Feng Luo , Stephan Tillmann

The division of compact Riemann surfaces into 3 cases K_C<0, g=0, or K_C=0, g=1, or K_C>0, g>=2 is well known, and corresponds to the familiar trichotomy of spherical, Euclidean and hyperbolic non-Euclidean plane geometry. Classification…

代数几何 · 数学 2007-05-23 Miles Reid

We develop a method for constructing standard complexes which turns easy the calculation of their algebraic invariants and, as well, the precise evaluation of whether these complexes are embeddable or not in a 3-manifold. This method…

综合数学 · 数学 2016-06-06 Rui Almeida

Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…

几何拓扑 · 数学 2020-02-18 Biplab Basak , Ed Swartz

Turaev Viro invariants are amongst the most powerful tools to distinguish 3-manifolds: They are implemented in mathematical software, and allow practical computations. The invariants can be computed purely combinatorially by enumerating…

计算几何 · 计算机科学 2018-10-24 Clément Maria , Jonathan Spreer

Scharlemann and Thompson define a numerical complexity for a 3-manifold using handle decompositions of the manifold. We show that for compact hyperbolic 3-manifolds this is linearly related to a definition of metric complexity in terms of…

几何拓扑 · 数学 2016-02-17 Diane Hoffoss , Joseph Maher

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…

几何拓扑 · 数学 2013-02-21 Sóstenes Lins , Ricardo Machado

We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…

几何拓扑 · 数学 2025-02-19 Shintaro Fushida-Hardy

We use minimal (or CMC) surfaces to describe 3-dimensional hyperbolic, anti-de Sitter, de Sitter or Minkowski manifolds. We consider whether these manifolds admit ``nice'' foliations and explicit metrics, and whether the space of these…

微分几何 · 数学 2008-11-26 Kirill Krasnov , Jean-Marc Schlenker

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.

组合数学 · 数学 2007-05-23 Alexander Below , Jesús A. De Loera , Jürgen Richter-Gebert

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

Topological complexity is a numerical homotopy invariant that measures the instability of motion planning in a space. To study the topological complexity of non-simply connected spaces, Costa and Farber introduced a cohomology class whose…

代数拓扑 · 数学 2026-03-11 Yuki Minowa

We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some…

几何拓扑 · 数学 2009-09-25 Sergei V. Matveev

Each closed oriented 3-manifold $M$ is naturally associated with a set of integers $D(M)$, the degrees of all self-maps on $M$. $D(M)$ is determined for each torus bundle and torus semi-bundle $M$. The structure of torus semi-bundle is…

几何拓扑 · 数学 2008-10-13 Hongbin Sun , Shicheng Wang , Jianchun Wu

We study distance relations in various simplicial complexes associated with low-dimensional manifolds. In particular, complexes satisfying certain topological conditions with vertices as simple multi-curves. We obtain bounds on the…

几何拓扑 · 数学 2025-05-05 Sayantika Mondal , Puttipong Pongtanapaisan , Hanh Vo

The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…

几何拓扑 · 数学 2014-02-26 William Jaco , J. Hyam Rubinstein , Stephan Tillmann

In 1970, Lawson solved the topological realization problem for minimal surfaces in the sphere, showing that any closed orientable surface can be minimally embedded in $\mathbb{S}^3$. The analogous problem for surfaces with boundary was…

微分几何 · 数学 2024-02-21 Mikhail Karpukhin , Robert Kusner , Peter McGrath , Daniel Stern