Add to ORKGLet nEN. 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
Given a short exact sequence of groups with certain conditions, 1 ? F ? G ? H ? 1, weprove that G ha...
[EN] The aim of this paper is to show how the number of conjugacy classes appearing in the product o...
AbstractWe consider possibilities for pairs (G,H), where G is a group, H a subgroup, and G is the un...
Let n ∈ N. Houghton's group Hn is the group of permutations of {1, . . . , n} × N, that eventually a...
Abstract. Let n ∈ N. Houghton’s group Hn is the group of permutations of {1,..., n}×N, that eventual...
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 \...
Ken Brown showed finiteness properties of Houghton's groups by studying the action of those groups o...
An erratum has been added to resolve an issue raised by Professor Derek Holt. This appears after the...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
We discuss the complexity of conjugacy problem in HNN-extensions of groups. We stratify the groups i...
For every finitely generated recursively presented group G we construct a finitely presented group H...
AbstractLet {K=x^{G}} be the conjugacy class of an element x of a group G, and suppose K is finite. ...
AbstractLet Gn=Gn(q) be the group of the upper unitriangular matrices of size n×n over Fq, the finit...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
Given a short exact sequence of groups with certain conditions, 1 ? F ? G ? H ? 1, weprove that G ha...
[EN] The aim of this paper is to show how the number of conjugacy classes appearing in the product o...
AbstractWe consider possibilities for pairs (G,H), where G is a group, H a subgroup, and G is the un...
Let n ∈ N. Houghton's group Hn is the group of permutations of {1, . . . , n} × N, that eventually a...
Abstract. Let n ∈ N. Houghton’s group Hn is the group of permutations of {1,..., n}×N, that eventual...
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 \...
Ken Brown showed finiteness properties of Houghton's groups by studying the action of those groups o...
An erratum has been added to resolve an issue raised by Professor Derek Holt. This appears after the...
The final publication is available at Springer via http://dx.doi.org/10.1007/s11856-016-1403-9We sol...
We discuss the complexity of conjugacy problem in HNN-extensions of groups. We stratify the groups i...
For every finitely generated recursively presented group G we construct a finitely presented group H...
AbstractLet {K=x^{G}} be the conjugacy class of an element x of a group G, and suppose K is finite. ...
AbstractLet Gn=Gn(q) be the group of the upper unitriangular matrices of size n×n over Fq, the finit...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
Given a short exact sequence of groups with certain conditions, 1 ? F ? G ? H ? 1, weprove that G ha...
[EN] The aim of this paper is to show how the number of conjugacy classes appearing in the product o...
AbstractWe consider possibilities for pairs (G,H), where G is a group, H a subgroup, and G is the un...