arXiv 0804.14892008-04math.GT

On certain enumeration problems in two-dimensional topology

Vladimir Turaev

备注：: 16 pages, corrected typos

英文摘要：

We announce a solution to several enumeration problems in topology of surfaces. This includes an enumeration of homotopy classes of sections of locally trivial fiber bundles over surfaces and a computation of non-abelian 1-cohomology of surfaces.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A tree traversal algorithm for decision problems in knot theory and 3-manifold topology

In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been variants of the classical double description method. In this paper we present the first practical normal surface enumeration algorithm that breaks out of the double description paradigm. This new algorithm is based on a tree traversal with feasibility and domination tests, and it …

2012-03-30cs.CGmath.GT

The topology of deformation spaces of Kleinian groups

Let M be a compact, hyperbolizable 3-manifold with nonempty incompressible boundary and let AH(π_1(M)) denote the space of (conjugacy classes of) discrete faithful representations of π_1(M) into PSL 2 (C). The components of the interior MP(π_1(M)) of AH(π_1(M)) (as a subset of the appropriate representation variety) are enumerated by the space A(M) of marked homeomorphism types of oriented, compact, irreducible 3-manifolds homotopy equivalent to M. In this paper, we give a topological enumeration of the components of the closure of MP(π_1(M)) and hence a conjectural topological enumeration of …

2000-11-01math.GT

Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations

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 because they do not represent topological 3-manifolds. In this paper we show how to preempt bad triangulations by detecting genus in partially-constructed vertex links, allowing us to prune the enumeration tree substantially. The key idea is to manipulate the boundary edges surrounding partial vertex links using expected logarithmic time operations. Practical…

2011-03-16cs.CGmath.COmath.GT

Optimizing the double description method for normal surface enumeration

Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an account of the vertex enumeration problem as it applies to normal surfaces, and present new optimizations that yield strong improvements in both running time and memory consumption. The resulting algorithms are tested using the freely available software package Regina.

2009-05-20cs.CGmath.COmath.GT

Computational topology with Regina: Algorithms, heuristics and implementations

Regina is a software package for studying 3-manifold triangulations and normal surfaces. It includes a graphical user interface and Python bindings, and also supports angle structures, census enumeration, combinatorial recognition of triangulations, and high-level functions such as 3-sphere recognition, unknot recognition and connected sum decomposition. This paper brings 3-manifold topologists up-to-date with Regina as it appears today, and documents for the first time in the literature some of the key algorithms, heuristics and implementations that are central to Regina's performance. These …

2013-02-22cs.CGcs.MSmath.GT

Enumerating Isotopy Classes of Tilings guided by the symmetry of Triply-Periodic Minimal Surfaces

We present a technique for the enumeration of all isotopically distinct ways of tiling a hyperbolic surface of finite genus, possibly nonorientable and with punctures and boundary. This provides a generalization of the enumeration of Delaney-Dress combinatorial tiling theory on the basis of isotopic tiling theory. To accomplish this, we derive representations of the mapping class group of the orbifold associated to the symmetry group in the group of outer automorphisms of the symmetry group of a tiling. We explicitly give descriptions of certain subgroups of mapping class groups and of tilings…

2020-08-14math.GT

更多相关论文收起更多论文

Quantum curves for the enumeration of ribbon graphs and hypermaps

The topological recursion of Eynard and Orantin governs a variety of problems in enumerative geometry and mathematical physics. The recursion uses the data of a spectral curve to define an infinite family of multidifferentials. It has been conjectured that, under certain conditions, the spectral curve possesses a non-commutative quantisation whose associated differential operator annihilates the partition function for the spectral curve. In this paper, we determine the quantum curves and partition functions for an infinite sequence of enumerative problems involving generalisations of ribbon gr…

2013-12-24math-phmath.AGmath.GT

从代数几何角度看不同性模空间的拓扑

An algebro-geometric perspective on the topology of moduli spaces of differentials

Boston College（波士顿学院）；Zhejiang University（浙江大学）

本文从代数几何角度综述不同性模空间的拓扑结构、已知结果及开放问题，探讨其与其他领域的联系。

2026-01-19math.AGmath.GT