Exploració per autor "Ventura Capell, Enric"Més informacióMés informació

Ara es mostren els items 66-72 de 72

    • The automorphism group of a free-by-cyclic group in rank 2 

      Bogopolski, Oleg; Martino, Armando; Ventura Capell, Enric (2007-05)
      Article
      Accés obert
      Let ¡ be an automorphism of a free group F 2 of rank 2 and let M ¡ = F 2 o ¡ Z be the corresponding mapping torus of ¡ . We prove that the group Out ( M ¡ ) is usually virtually cyclic. More- over, ...

    • The conjugacy problem for free-by-cyclic groups 

      Martino, Armando; Ventura Capell, Enric (2004-04)
      Report de recerca
      Accés obert
      We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed sub- groups of free group ...

    • The conjugacy problem in automaton groups is not solvable 

      Šunic, Z.; Ventura Capell, Enric (2012-08-15)
      Article
      Accés obert
      (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 ...

    • The conjugacy problem in extensions of Thompson's group F 

      Burillo Puig, José; Matucci, Francesco; Ventura Capell, Enric (2016-10-01)
      Article
      Accés obert
      We solve the twisted conjugacy problem on Thompson’s group F. We also exhibit orbit undecidable subgroups of Aut(F), and give a proof that Aut(F) and Aut+(F) are orbit decidable provided a certain conjecture on Thompson’s ...

    • TOPOLOGIA 

      Ventura Capell, Enric (Universitat Politècnica de Catalunya, 2024-04-04)
      Examen
      Accés restringit a la comunitat UPC

    • Twisted conjugacy in braid groups 

      Gonzalez Meneses, Juan; Ventura Capell, Enric (2014-01-01)
      Article
      Accés obert
      In this note we solve the twisted conjugacy problem for braid groups, i.e., we propose an algorithm which, given two braids u,v is an element of B-n and an automorphism phi is an element of Aut(B-n), decides whether v = ...

    • Twisted conjugacy problem for endomorphisms of metabelian groups 

      Ventura Capell, Enric; Romankov, Vitali (Springer, 2009-03-01)
      Article
      Accés restringit per política de l'editorial
      Let M be a finitely generated metabelian group explicitly presented in a variety A2 of all metabelian groups. An algorithm is constructed which, for every endomorphism ϕ ∈ End(M) identical modulo an Abelian normal subgroup ...