Conjugacy in Houghton's groups
Conjugacy in Houghton's groups
Let 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.
3-16
Antolin, Y.
57d17d79-404f-4fee-987b-441dab625ce4
Burillo, J.
8c1e5430-418d-4b1e-8112-0c23bac3b390
Martino, A.
65f1ff81-7659-4543-8ee2-0a109be286f1
21 January 2015
Antolin, Y.
57d17d79-404f-4fee-987b-441dab625ce4
Burillo, J.
8c1e5430-418d-4b1e-8112-0c23bac3b390
Martino, A.
65f1ff81-7659-4543-8ee2-0a109be286f1
Antolin, Y., Burillo, J. and Martino, A.
(2015)
Conjugacy in Houghton's groups.
Publicacions Matemàtiques, 59 (1), .
Abstract
Let 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.
Text
conj houghton.pdf
- Accepted Manuscript
More information
Published date: 21 January 2015
Organisations:
Pure Mathematics
Identifiers
Local EPrints ID: 402875
URI: http://eprints.soton.ac.uk/id/eprint/402875
ISSN: 0073-8301
PURE UUID: 81645127-a27d-4fbe-b3f9-985f90e4a20a
Catalogue record
Date deposited: 17 Nov 2016 14:13
Last modified: 15 Mar 2024 03:32
Export record
Contributors
Author:
Y. Antolin
Author:
J. Burillo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics