Related papers: Conjugacy problem in T-RAAGs

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…

We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand…

In the stable marriage and roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually accepted agents. If any…

We describe an algorithm to find the virtual cohomological dimension of the automorphism group of a right-angled Artin group. The algorithm works in the relative setting; in particular it also applies to untwisted automorphism groups and…

We prove that every RAAG (a Right-Angled Artin Group) embeds in the group of Hamiltonian symplectomorphisms of the 2-sphere.

Let $G$ and $G'$ be two right-angled Artin groups (RAAG). We show they are quasi-isometric iff they are isomorphic, under the assumption that $Out(G)$ and $Out(G')$ are finite. If only $Out(G)$ is finite, then $G'$ is quasi-isometric $G$…

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…

In this article, we prove that embeddings of right-angled Artin group $A_1$ on the complement of a linear forest into another right-angled Artin group $A_2$ can be reduced to full embeddings of the defining graph of $A_1$ into the extension…

We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.

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…

A result of Bridson, Howie, Miller and Short states that if $S$ is a subgroup of type $FP_{n}(\mathbb{Q})$ of the direct product of $n$ limit groups over free groups, then $S$ is virtually the direct product of limit groups over free…

Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…

Conjugacy is not the only possible primitive for designing braid-based protocols. To illustrate this principle, we describe a Fiat--Shamir-style authentication protocol that be can be implemented using any binary operation that satisfies…

In this paper, we deal with stable homology computations with twisted coefficients for mapping class groups of surfaces and of 3-manifolds, automorphism groups of free groups with boundaries and automorphism groups of certain right-angled…

An introduction to the universal algebra approach to Higman-Thompson groups (including Thompson's group $V$) is given, following a series of lectures by Graham Higman in 1973. In these talks, Higman outlined an algorithm for the conjugacy…

This paper presents efficient algorithms for solving the problem of aligning a protein structure template to a query amino-acid sequence, known as protein threading problem. We consider the problem as a special case of graph matching…

Let $\mathcal{C}$ be a class of finite groups closed under taking subgroups, quotients, and extensions with abelian kernel. The right-angled Artin pro-$\mathcal{C}$ group $G_\Gamma$ (pro-$\mathcal{C}$ RAAG for short) is the…

A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics or software engineering, it is required…

This paper focuses on tools for constructing 4-manifolds that have fundamental group $G$ isomorphic to a right-angled Artin group and that are also minimal, in the sense that they minimize $b_2(M)$, the dimension of $H_2(M;\mathbb{Q})$. For…

Using abelian coverings of Salvetti complexes, embeddings of outer automorphism groups of right-angled Artin groups (RAAGs) into outer automorphism groups of their particular characteristic subgroups are constructed. Virtual embeddings of…