Add to ORKGAbstract. We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the “generic ” lattice-ordered group Aut(R). We use these techniques in order to show that for all f, g ∈ Aut(R), the equation xfx = g is effectively solvable in Aut(R). 1
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
Abstract. We have proved in [Pr] that fundamental groups of oriented geometrizable 3-manifolds have ...
This study is an exposition of the article entitled On a Symmetry Criterion for Conjugacy in Finite ...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
We prove that if Gj are right orderable groups with non-trivial cyclic subgroups Cj (j = 1, 2), then...
We give a unified solution the conjugacy problem in Thompson's groups F, V , and T using strand diag...
In this project, we present an efficient implementation of the solution to the conjugacy problem in ...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for det...
We prove that for every finite rank Coxeter group there exists a polynomial (cubic) solution to the ...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
In this paper we present a new, practical algorithm for solving the subgroup conjugacy problem in th...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
Let G be a group endowed with a solution to the conjugacy problem and with an algorithm which comput...
29 pages, 7 figuresInternational audienceWe prove that the conjugacy problem in right-angled Artin g...
(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphi...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
Abstract. We have proved in [Pr] that fundamental groups of oriented geometrizable 3-manifolds have ...
This study is an exposition of the article entitled On a Symmetry Criterion for Conjugacy in Finite ...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
We prove that if Gj are right orderable groups with non-trivial cyclic subgroups Cj (j = 1, 2), then...
We give a unified solution the conjugacy problem in Thompson's groups F, V , and T using strand diag...
In this project, we present an efficient implementation of the solution to the conjugacy problem in ...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for det...
We prove that for every finite rank Coxeter group there exists a polynomial (cubic) solution to the ...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
In this paper we present a new, practical algorithm for solving the subgroup conjugacy problem in th...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
Let G be a group endowed with a solution to the conjugacy problem and with an algorithm which comput...
29 pages, 7 figuresInternational audienceWe prove that the conjugacy problem in right-angled Artin g...
(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphi...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
Abstract. We have proved in [Pr] that fundamental groups of oriented geometrizable 3-manifolds have ...
This study is an exposition of the article entitled On a Symmetry Criterion for Conjugacy in Finite ...