Related papers: Decision problems for 3-manifolds and their fundam…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…
An important endeavor in computer science is to understand the expressive power of logical formalisms over discrete structures, such as words. Naturally, "understanding" is not a mathematical notion. This investigation requires therefore a…
We classify the homeomorphism types of the Morse boundaries of all 3-manifold groups into 9 different possible homeomorphism types, and show how the Morse boundary depends on the geometric decomposition.
The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…
This is a problem list in the theory of foliations and laminations of 3-manifolds. The focus is on the relationship of foliations and laminations with other aspects of 3-manifold topology, especially with the Thurston theory of geometric…
The word problem of a group is a very important question. The word problem in the braid group is of particular interest for topologists, algebraists and geometers. In previouse article we have looked at the braid group from a topological…
We give a criterion on a group $\pi$ and a homomorphism $w \colon \pi \to C_2$ under which closed $4$-manifolds with fundamental group $\pi$ and orientation character $w$ are classified up to homotopy equivalence by their quadratic…
In this paper we determined all of the possible self mapping degrees of the manifolds with $S^3$-geometry, which are supposed to be all 3-manifolds with finite fundamental groups. This is a part of a project to determine all possible self…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
The automorphism groups of certain factorial complex affine threefolds admitting locally trivial actions of the additive group are determined. As a consequence new counterexamples to a generalized cancellation problem are obtained.
We prove that the conjugacy problem in Out(Fm) is solvable for the class of outer automorphisms whose restrictions to their polynomial subgroups are of finite order. To do this, we first investigate the structure of suspensions of free…
In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, $B_3$, have polynomial time solutions we prove that a very natural…
We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…
This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…
In May 2015, a conference entitled "Groups, Geometry, and 3-manifolds" was held at the University of California, Berkeley. The organizers asked participants to suggest problems and open questions, related in some way to the subject of the…
Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…
We give a complete classification of the spherical 3-manifolds that bound smooth rational homology 4-balls. Furthermore, we determine the order of spherical 3-manifolds in the rational homology cobordism group of rational homology…