Related papers: Deciding Isomorphy using Dehn fillings, the splitt…

We compute explicitly the automorphism and outer automorphism group of all large-type free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne complexes in a purely algebraic manner, i.e. in a way that is…

We introduce a number of new tools for the study of relatively hyperbolic groups. First, given a relatively hyperbolic group G, we construct a nice combinatorial Gromov hyperbolic model space acted on properly by G, which reflects the…

Given two Lagrangian spheres in an exact symplectic manifold, we find conditions under which the Dehn twists about them generate a free non-abelian subgroup of the symplectic mapping class group. This extends a result of Ishida for Riemann…

For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…

We study direct products of free-abelian and free groups with special emphasis on algorithmic problems. After giving natural extensions of standard notions into that family, we find an explicit expression for an arbitrary endomorphism of…

We show that there are at most finitely many one cusped orientable hyperbolic 3-manifolds which have more than eight non-hyperbolic Dehn fillings. Moreover, we show that determining these finitely many manifolds is decidable.

We consider the following two algorithmic problems: given a graph $G$ and a subgraph $H\subseteq G$, decide whether $H$ is an isometric or a geodesically convex subgraph of $G$. It is relatively easy to see that the problems can be solved…

The Subgroup Isomorphism Problem for Integral Group Rings asks for which finite groups U it is true that if U is isomorphic to a subgroup of V(ZG), the group of normalized units of the integral group ring of the finite group G, it must be…

The isomorphism problem for graphs (GI) and the isomorphism problem for groups (GrISO) have been studied extensively by researchers. The current best algorithms for both these problems run in quasipolynomial time. In this paper, we study…

We give a cohomological criterion for existence of outer automorphisms of a semisimple algebraic group over an arbitrary field. This criterion is then applied to the special case of groups of type D_2n over a global field, which completes…

Heisenberg groups over algebras with central involution and their automorphism groups are constructed. The complex quaternion group algebra over a prime field is used as an example. Its subspaces provide finite models for each of the real…

It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact these two problems are polynomial-time equivalent). We show that, analogously, the group isomorphism problem is…

Given two graphs $H$ and $G$, the Subgraph Isomorphism problem asks if $H$ is isomorphic to a subgraph of $G$. While NP-hard in general, algorithms exist for various parameterized versions of the problem: for example, the problem can be…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We describe the compatibility JSJ decomposition over abelian groups. We prove that in…

Graph isomorphism is an important problem as its worst-case time complexity is not yet fully understood. In this study, we try to draw parallels between a related optimization problem called point set registration. A graph can be…

We use algebraic techniques to study homological filling functions of groups and their subgroups. If $G$ is a group admitting a finite $(n+1)$--dimensional $K(G,1)$ and $H \leq G$ is of type $F_{n+1}$, then the $n^{th}$--homological filling…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…

Let $ \text{Mod}(S_g)$ denote the mapping class group of the closed orientable surface $S_g$ of genus $g\geq 2$, and let $f\in \text{Mod}(S_g)$ be of finite order. We give an inductive procedure to construct an explicit hyperbolic structure…

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…