The search session has expired. Please query the service again.

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 664

Showing per page

Computation of centralizers in Braid groups and Garside groups.

Nuno Franco, Juan González-Meneses (2003)

Revista Matemática Iberoamericana

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conjugacy problem given by the authors in [9], are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups [2]. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.

Conjugacy equivalence relation on subgroups

Alessandro Andretta, Riccardo Camerlo, Greg Hjorth (2001)

Fundamenta Mathematicae

If G is a countable group containing a copy of F₂ then the conjugacy equivalence relation on subgroups of G attains the maximal possible complexity.

Conjugacy pinched and cyclically pinched one-relator groups.

Benjamin Fine, Gerhard Rosenberger, Michael Stille (1997)

Revista Matemática de la Universidad Complutense de Madrid

Here we consider two classes of torsion-free one-relator groups which have proved quite amenable to study-the cyclically pinched one-relator groups and the conjugacy pinched one-relator groups. The former is the class of groups which are free products of free groups with cyclic amalgamations while the latter is the class of HNN extensions of free groups with cyclic associated subgroups. Both are generalizations of surface groups. We compare and contrast results in these classes relative to n-freeness,...

Currently displaying 81 – 100 of 664