Conjugacy search problem and the Andrews–Curtis conjecture
نویسندگان
چکیده
منابع مشابه
A Conjecture about Conjugacy in Free Groups
Say that an element of a free group is a pure conjugate if it can be expressed from the generators using exclusively the conjugacy operation. We study free reductions in words representing pure conjugates. Using finite state automata, we attribute to the letters in such words levels that live in some free left distributive system. If a certain conjecture about this system is true, then reductio...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اول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...
متن کاملA note on conjugacy search and racks
We show that for every effective left conjugacy closed left quasigroup, there is an induced rack that retains the conjugation structure of the left translations. This means that cryptographic protocols relying on conjugacy search can be secure only if conjugacy search of left translations is infeasible in the induced rack. We note that, in fact, protocols based on conjugacy search could be simp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups Complexity Cryptology
سال: 2019
ISSN: 1869-6104,1867-1144
DOI: 10.1515/gcc-2019-2005