Independence of the conjugacy problem and conjugacy separability
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913796552916992 |
|---|---|
| author | Vandeputte, Lukas |
| author_facet | Vandeputte, Lukas |
| contents | We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy problem can have complexity which lies arbitrarily far from the optimum. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_12174 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Independence of the conjugacy problem and conjugacy separability Vandeputte, Lukas Group Theory We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy problem can have complexity which lies arbitrarily far from the optimum. |
| title | Independence of the conjugacy problem and conjugacy separability |
| topic | Group Theory |
| url | https://arxiv.org/abs/2504.12174 |