Abstract(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, finitely generated, orbit undecidable, free subgroups of GLd(Z), for d⩾6, and Aut(Fd), for d⩾5, are constructed as well
[EN] We summarize several results about non-simplicity, solvability and normal structure of finite g...
AbstractThe main theorem is that if G is a Polish group with a comeagre conjugacy class, and G acts ...
Building on work of Popa, Ioana, and Epstein--Törnquist, we show that, for every nonamenable countab...
(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphi...
Given a short exact sequence of groups with certain conditions, 1 ? F ? G ? H ? 1, weprove that G ha...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related t...
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by usi...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
The knapsack problem is a classic optimisation problem that has been recently extended in the settin...
We suggest several automaton groups as key-agreement platforms for Anshl-Anshel-Goldfeld metascheme,...
AbstractNielsen type arguments have been used to prove some problems in free group (e.g., the genera...
AbstractLet F be an infinitely generated free group and let R be a fully invariant subgroup of F suc...
We prove that the problem of deciding whether or not two group elements are conjugate can be solved ...
In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm ...
[EN] We summarize several results about non-simplicity, solvability and normal structure of finite g...
AbstractThe main theorem is that if G is a Polish group with a comeagre conjugacy class, and G acts ...
Building on work of Popa, Ioana, and Epstein--Törnquist, we show that, for every nonamenable countab...
(Free abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphi...
Given a short exact sequence of groups with certain conditions, 1 ? F ? G ? H ? 1, weprove that G ha...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related t...
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by usi...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
The knapsack problem is a classic optimisation problem that has been recently extended in the settin...
We suggest several automaton groups as key-agreement platforms for Anshl-Anshel-Goldfeld metascheme,...
AbstractNielsen type arguments have been used to prove some problems in free group (e.g., the genera...
AbstractLet F be an infinitely generated free group and let R be a fully invariant subgroup of F suc...
We prove that the problem of deciding whether or not two group elements are conjugate can be solved ...
In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm ...
[EN] We summarize several results about non-simplicity, solvability and normal structure of finite g...
AbstractThe main theorem is that if G is a Polish group with a comeagre conjugacy class, and G acts ...
Building on work of Popa, Ioana, and Epstein--Törnquist, we show that, for every nonamenable countab...
DOI