Related papers: On the Conjugacy Problem in Groups and its Variant…
We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP). The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be…
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…
In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…
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…
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…
There currently exists no algebraic algorithm for computing twisted conjugacy classes in free groups. We propose a new technique for deciding twisted conjugacy relations using nilpotent quotients. Our technique is generalization of the…
We study twisted conjugacy classes of the unit element in different groups. Fel'shtyn and Troitsky showed that the twisted conjugacy class of the unit element of an abelian group is a subgroup for every automorphism. The structure is…
We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…
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…
An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…
We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…
In 2009, Crisp, Godelle and Wiest constructed a linear-time algorithm to solve the conjugacy problem in right-angled Artin groups. This algorithm has now been implemented in Python, and the code is freely available on GitHub. This document…
A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…
Motivated by the study of the conjugacy problem for outer automorphism of free groups, we develop the algorithmic theory of the free-by-cyclic group produced by unipotent linearly growing automorphisms of f.g. free groups. We compute…
In this paper we give an algorithm for solving a main case of the conjugacy problem in the braid groups. We also prove that half-twists satisfy a special root property which allows us to reduce the solution for the conjugacy problem in…
In this paper we provide an alternative solution to a result by Juh\'{a}sz that the twisted conjugacy problem for odd dihedral Artin groups is solvable, that is, groups with presentation $G(m) = \langle a,b \; | \; _{m}(a,b) = {}_{m}(b,a)…
We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the…
In this article, we explore the problem of determining isomorphisms between the twisted complex group algebras of finite $p$-groups. This problem bears similarity to the classical group algebra isomorphism problem and has been recently…
In this paper we consider the {\em conjugacy stability} property of subgroups and provide effective procedures to solve the problem in several classes of groups. In particular, we start with free groups, that is, we give an effective…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…