In this paper we extend this approach. Having a Nielsen reduced set of generators for subgroups H and K one can solve a lot of intersection and conjugacy ...
As by-product a new proof is given that the free groups have the Howson property. The second problem is the conjugacy problem of Moldavanskii. We developed a ...
This thesis deals with the conjugacy problem in classes of groups which can be written as HNN extension or amalgamated product, and shows that the ...
Author: Avenhaus J.,Madlener K. Publisher. Elsevier BV. Subject. General Computer Science,Theoretical Computer Science. Reference ...
Jürgen Avenhaus, Klaus Madlener: On the Complexity of Intersection and Conjugacy Problems in Free Groups. Theor. Comput. Sci. 32: 279-295 (1984).
Jul 18, 2024 · In terms of "complexity classes", intersecting two permutation groups is one of a whole host of problems that appear "just above" graph ...
Missing: Free | Show results with:Free
To solve the twisted conjugacy problem in free groups, we use an algorithm for deciding membership in a subgroup of a free group. To this end, we first ...
Missing: Intersection | Show results with:Intersection
Sep 25, 2014 · The coset intersection problem is typically phrased oppositely: the answer is yes iff they intersect. It is this version of the problem that's ...
Missing: Conjugacy | Show results with:Conjugacy
... free groups, Theoret. Comput. Sci., 1984, 32, pp. 61-76. Zbl0555.20015; 5. J. AVENHAUS, K. MADLENER, On the complexity of intersection and conjugacy problems ...
Nov 18, 2022 · Abstract. We establish a connection between the generalized conjugacy problem for a G- by-Z group, GCP(G ⋊ Z), and two algorithmic problems ...