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

We determine which three-manifolds are dominated by products. The result is that a closed, oriented, connected three-manifold is dominated by a product if and only if it is finitely covered either by a product or by a connected sum of…

The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

We classify the normal CR structures on $S^3$ and their automorphism groups. Together with [3], this closes the classification of normal CR structures on contact 3-manifolds. We give a criterion to compare 2 normal CR structures, and we…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

Take a bounded symmetric domain $D$ and an arithmetic subgroup $\Gamma$ of ${\rm Aut}(D)$. Take the quotient $D/\Gamma$, compactify and resolve the singularities. We study the fundamental group of the compact complex manifolds that result…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We study the growth of the rank of subgroups of finite index in residually finite groups, by relating it to the notion of cost. As a by-product, we show that the `Rank vs. Heegaard genus' conjecture on hyperbolic 3-manifolds is incompatible…

We establish a 3-manifold invariant for each finite-dimensional, involutory Hopf algebra. If the Hopf algebra is the group algebra of a group $G$, the invariant counts homomorphisms from the fundamental group of the manifold to $G$. The…

We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

Two smooth manifolds M and N are called R-diffeomorphic if their product with the real line are diffeomorphic. We consider the following simplification problem: does R-diffeomorphism imply diffeomorphism or homeomorphism? For compact…

One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…

The main result of the present paper is the construction of fundamental solutions for a class of multidimensional elliptic equations with three singular coefficients, which could be expressed in terms of a confluent hypergeometric function…

When studying families in the moduli space of dynamical systems, choosing an appropriate representative function for a conjugacy class can be a delicate task. The most delicate questions surround rationality of the conjugacy class compared…

The complexity and decidability of various decision problems involving the shuffle operation are studied. The following three problems are all shown to be $NP$-complete: given a nondeterministic finite automaton (NFA) $M$, and two words $u$…

We introduce a new class of possibly noncompact n-dimensional manifolds without boundary associated to finite data which we call topological automata. This class is large enough to contain many interesting examples of open 2-dimensional and…

Closed oriented 4-manifolds with the same geometrically 2-dimensional fundamental group (satisfying certain properties) are classified up to $s$-cobordism by their $w_2$-type, equivariant intersection form and the Kirby-Siebenmann…