相关论文: Conjugacy in Artin groups of extra-large type

In this paper, we construct an implementable algorithm which solves the conjugacy problem in twisted right-angled Artin groups (T-RAAGs). In certain cases, the complexity is known to be linear, by reducing the problem to the twisted…

This article resolves several long-standing conjectures about Artin groups of euclidean type. In particular, we prove that every irreducible euclidean Artin group is a torsion-free centerless group with a decidable word problem and a…

We prove that the word problem in an Artin group G based on a diagram without A_3 or B_3 subdiagrams can be solved using a system of length preserving rewrite rules which, together with free reduction, can be used to reduce any word over…

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…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

There exist right angled Artin groups $A$ such that the isomorphism problem for finitely presented subgroups of $A$ is unsolvable, and for certain finitely presented subgroups the conjugacy and membership problems are unsolvable. It follows…

We give a complete classification of conjugacy stable parabolic subgroups of Artin-Tits groups of spherical type. This answers a question posed by Ivan Marin and generalizes a theorem obtained by Juan Gonz\'alez-Meneses in the specific case…

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…

We construct a finitely presented group with quadratic Dehn function and undecidable conjugacy problem. This solves E. Rips' problem formulated in 1992. v2: misprints corrected. v3: lemmas 4.7, 4.10 corrected, more misprints fixed.

Dual presentations of Coxeter groups have recently led to breakthroughs in our understanding of affine Artin groups. In particular, they led to the proof of the $K(\pi, 1)$ conjecture and to the solution of the word problem. Will the "dual…

We prove that many Artin groups of large type satisfy the rapid decay property, including all those of extra-large type. For many of these, including all 3-generator groups of extra-large type, a result of Lafforgue applies to show that the…

The result of this paper is the determination of the cohomology of Artin groups of type A_n, B_n and \tilde{A}_{n} with non-trivial local coefficients. The main result is an explicit computation of the cohomology of the Artin group of type…

The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…

Multifraction reduction is a new approach to the word problem for Artin-Tits groups and, more generally, for the enveloping group of a monoid in which any two elements admit a greatest common divisor. This approach is based on a rewrite…

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 prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…

In this paper we describe conjugacy geodesic representatives in any dihedral Artin group $G(m)$, $m\geq 3$, which we then use to calculate asymptotics for the conjugacy growth of $G(m)$, and show that the conjugacy growth series of $G(m)$…

One can observe that Coxeter groups and right-angled Artin groups share the same solution to the word problem. On the other hand, in his study of reflection subgroups of Coxeter groups Dyer introduces a family of groups, which we call Dyer…

Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…

We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super…

Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…