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

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

Displaying 81 – 100 of 663

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,...

Critical constants for recurrence of random walks on G -spaces

Anna Erschler (2005)

Annales de l’institut Fourier

We introduce the notion of a critical constant c r t for recurrence of random walks on G -spaces. For a subgroup H of a finitely generated group G the critical constant is an asymptotic invariant of the quotient G -space G / H . We show that for any infinite G -space c r t 1 / 2 . We say that G / H is very small if c r t < 1 . For a normal subgroup H the quotient space G / H is very small if and only if it is finite. However, we give examples of infinite very small G -spaces. We show also that critical constants for recurrence can be used...

Currently displaying 81 – 100 of 663