Add to ORKGAbstract. Let n ∈ N. Houghton’s group Hn is the group of permutations of {1,..., n}×N, that eventually act as a translation in each copy of N. We prove the solvability of the conjugacy problem and conjugator search problem for Hn, n ≥ 2
A classical conjecture of Graham Higman states that the number of conjugacy classes in U_n(q), the g...
We present an algorithm for solving the multiple conjugacy search problem in virtually nilpotent pol...
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permu...
Let n ∈ N. Houghton’s group Hn is the group of permutations of {1, . . . , n} × N, that eventually a...
Let $ n\in \N$ . Houghton'\''s group $ H_n$ is the group of permutations of $ \{1,\dots, n\}\times \...
Let nEN. Houghton's group Hn is the group of permutations of {1,…,n}×N, that eventually act as a tra...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
For every finitely generated recursively presented group G we construct a finitely presented group H...
In this project, we present an efficient implementation of the solution to the conjugacy problem in ...
We discuss the complexity of conjugacy problem in HNN-extensions of groups. We stratify the groups i...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
Let G be a group endowed with a solution to the conjugacy problem and with an algorithm which comput...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for det...
Abstract. We discuss the complexity of conjugacy problem in HNN-extensions of groups. We stratify th...
We give a unified solution the conjugacy problem in Thompson's groups F, V , and T using strand diag...
A classical conjecture of Graham Higman states that the number of conjugacy classes in U_n(q), the g...
We present an algorithm for solving the multiple conjugacy search problem in virtually nilpotent pol...
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permu...
Let n ∈ N. Houghton’s group Hn is the group of permutations of {1, . . . , n} × N, that eventually a...
Let $ n\in \N$ . Houghton'\''s group $ H_n$ is the group of permutations of $ \{1,\dots, n\}\times \...
Let nEN. Houghton's group Hn is the group of permutations of {1,…,n}×N, that eventually act as a tra...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for dete...
For every finitely generated recursively presented group G we construct a finitely presented group H...
In this project, we present an efficient implementation of the solution to the conjugacy problem in ...
We discuss the complexity of conjugacy problem in HNN-extensions of groups. We stratify the groups i...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
Let G be a group endowed with a solution to the conjugacy problem and with an algorithm which comput...
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for det...
Abstract. We discuss the complexity of conjugacy problem in HNN-extensions of groups. We stratify th...
We give a unified solution the conjugacy problem in Thompson's groups F, V , and T using strand diag...
A classical conjecture of Graham Higman states that the number of conjugacy classes in U_n(q), the g...
We present an algorithm for solving the multiple conjugacy search problem in virtually nilpotent pol...
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permu...