English
Related papers

Related papers: Decision problems for 3-manifolds and their fundam…

200 papers

This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost…

Geometric Topology · Mathematics 2020-02-07 Marc Lackenby

We have proved in [Topology, 45 1 (2006)] that fundamental groups of oriented geometrizable 3-manifolds have a solvable conjugacy problem. We now consider the case of groups of non-oriented geometrizable 3-manifolds in order to conclude…

Group Theory · Mathematics 2007-05-23 Jean-Philippe Preaux

We prove that fundamental groups of orientable (geometrizable) 3-manifolds have a solvable conjugacy problem.

Group Theory · Mathematics 2013-08-14 Jean-Philippe Préaux

We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with…

Geometric Topology · Mathematics 2017-04-28 Marc Lackenby

We show that the Membership Problem for finitely generated subgroups of 3-manifold groups is solvable.

Geometric Topology · Mathematics 2016-09-21 Stefan Friedl , Henry Wilton

We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…

Group Theory · Mathematics 2013-08-14 Jean-Philippe Préaux

We give a more geometric approach to an algorithm for deciding whether two hyperbolic 3-manifolds are homeomorphic. We also give a more algebraic approach to the homeomorphism problem for geometric, but non-hyperbolic, 3-manifolds.

Geometric Topology · Mathematics 2014-11-11 Peter Scott , Hamish Short

In this work we ask when a group is a 3-manifold group, or more specifically, when does a group presentation come naturally from a Heegaard diagram for a 3-manifold? We will give some conditions for partial answers to this form of the…

Geometric Topology · Mathematics 2016-11-25 Karoline P. Null

Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed,…

Group Theory · Mathematics 2012-10-09 Daniel Groves , Jason Fox Manning , Henry Wilton

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Group Theory · Mathematics 2007-05-23 Martin R. Bridson

We prove foundational results about the set of homomorphisms from a finitely generated group to the collection of all fundamental groups of compact 3-manifolds and answer questions of Reid-Wang-Zhou and Agol-Liu.

Geometric Topology · Mathematics 2024-07-15 Daniel Groves , Michael Hull , Hao Liang

We answer two questions on the complexities of decision problems of groups, each related to a classical result. First, C. Miller characterized the complexity of the isomorphism problem for finitely presented groups in 1971. We do the same…

Logic · Mathematics 2024-03-06 Uri Andrews , Matthew Harrison-Trainor , Meng-Che "Turbo" Ho

We give a bounded runtime solution to the homeomorphism problem for closed hyperbolic 3-manifolds. This is an algorithm which, given two triangulations of hyperbolic 3-manifolds by at most $t$ tetrahedra, decides if they represent the same…

Geometric Topology · Mathematics 2021-08-03 Joe Scull

Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…

Group Theory · Mathematics 2024-11-22 Giovanni De Franceschi , Martin W. Liebeck , E. A. O'Brien

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

Group Theory · Mathematics 2019-08-27 Carmelo Vaccaro

We give some general criteria of being a homeomorphism for continuous mappings of topological manifolds, as well as criteria of being a diffeomorphism for smooth mappings of smooth manifolds. As an illustration, we apply these criteria to…

Geometric Topology · Mathematics 2015-04-07 Marina Prokhorova

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…

Group Theory · Mathematics 2017-12-14 Mark Brittenham , Susan Hermiller , Tim Susse

In this paper, we prove a geometrization conjecture, every orientable smooth closed 3-manifold with finite fundamental group is homeomorphic to $S^3/G$ for some finite cyclic subgroup $G\subset {Isom}^+(S^3)$.

Geometric Topology · Mathematics 2012-08-28 Ming Yang

This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…

Group Theory · Mathematics 2015-05-27 Alan J. Cain , Markus Pfeiffer

Computations based on explicit 4-periodic resolutions are given for the cohomology of the finite groups G known to act freely on S^3, as well as the cohomology rings of the associated 3-manifolds (spherical space forms) M = S^3/G. Chain…

Algebraic Topology · Mathematics 2009-04-14 Satoshi Tomoda , Peter Zvengrowski
‹ Prev 1 2 3 10 Next ›