The conjugacy problem for groups, and Higman embeddings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Conjugacy Problem for Groups, and Higman Embeddings

For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable conjugacy problem. Moreover, G and H have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D.

متن کامل

The Conjugacy Problem and Higman Embeddings

For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable conjugacy problem. Moreover G and H have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D. Collins.

متن کامل

The Conjugacy Problem for Relatively Hyperbolic Groups

Solvability of the conjugacy problem for relatively hyperbolic groups was announced by Gromov [12]. Using the definition of Farb of a relatively hyperbolic group [9], we prove this assertion. We conclude that the conjugacy problem is solvable for the following two classes of groups: fundamental groups of complete, finite-volume, negatively curved manifolds, and finitely generated fully residual...

متن کامل

Conjugacy problem for braid groups and Garside groups

We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee [3]. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).

متن کامل

The Word and Conjugacy Problem for Shuffle Groups

Dedicated to Benjamin Fine on the occasion of his 60th birthday. After reviewing the importance of the Word Problem and the Conjugacy Problem for group-based cryptosystems, this paper offers an efficient method for solving both problems in the Shuffle Group.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Research Announcements of the American Mathematical Society

سال: 2003

ISSN: 1079-6762

DOI: 10.1090/s1079-6762-03-00110-0