Add to ORKGThe Lyndon's Group FZx is of great interest to algebraists due to its unique properties. Using Van Kampen diagrams and results already proven for conjugate elements in FZx by Myasnikov and Remeslennikov, this thesis proves that the conjugacy problem in the Lyndon's group is solvable. The concept of being conjugately residually free is introduced and it is shown that a single free extension of a centralizer of a free group is conjugately residually free
AbstractLet F be an infinitely generated free group and let R be a fully invariant subgroup of F suc...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
We describe the relation between two characterizations of conjugacy in groups of piecewise-linear ho...
Abstract. We study the conjugacy problem in cyclic extensions of free groups. It is shown that the c...
In this note, we prove that certain one-relator groups are residually finite and have solvable (powe...
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by us...
We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollar...
Let G be a group endowed with a solution to the conjugacy problem and with an algorithm which comput...
AbstractWe shall prove the conjecture of Myasnikov and Remeslennikov [4] which states that a finitel...
In this paper we study Lyndon's equation xpyqzr = 1, with x, y, z group elements and p, q, r positiv...
In this paper we study Lyndon\u27s equation x(p)y(q)z(r) = 1, with x, y, z group elements and p, q, ...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
This thesis deals with the conjugacy problem in groups and its twisted variants. We analyze recent r...
Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable i...
AbstractWe prove the Arad–Herzog conjecture for various families of finite simple groups — if A and ...
AbstractLet F be an infinitely generated free group and let R be a fully invariant subgroup of F suc...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
We describe the relation between two characterizations of conjugacy in groups of piecewise-linear ho...
Abstract. We study the conjugacy problem in cyclic extensions of free groups. It is shown that the c...
In this note, we prove that certain one-relator groups are residually finite and have solvable (powe...
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by us...
We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollar...
Let G be a group endowed with a solution to the conjugacy problem and with an algorithm which comput...
AbstractWe shall prove the conjecture of Myasnikov and Remeslennikov [4] which states that a finitel...
In this paper we study Lyndon's equation xpyqzr = 1, with x, y, z group elements and p, q, r positiv...
In this paper we study Lyndon\u27s equation x(p)y(q)z(r) = 1, with x, y, z group elements and p, q, ...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
This thesis deals with the conjugacy problem in groups and its twisted variants. We analyze recent r...
Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable i...
AbstractWe prove the Arad–Herzog conjecture for various families of finite simple groups — if A and ...
AbstractLet F be an infinitely generated free group and let R be a fully invariant subgroup of F suc...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
We describe the relation between two characterizations of conjugacy in groups of piecewise-linear ho...