PreprintarXiv licencearXiv
Conjugacy and period in symmetric diagram groups
Abstract
We show how to solve the conjugacy (search) problem and the problem of determining whether a given element is periodic in symmetric diagram groups based on finite semigroup presentations.
Related
- Tilings of symmetric and alternating groups by conjugacy classes
- The Complexity of Conjugacy, Orbit Equivalence, and von Neumann Equivalence of Actions of Nonamenable Groups
- Local conjugacy in prosolvable groups
- Sylow $2$-Subgroups of Finite Groups with a Single Conjugacy Class of Involutions
- Irrationality of the conjugacy growth on Heisenberg groups
BibTeX
@misc{tarocchi2026conjugacy,
title = {{Conjugacy and period in symmetric diagram groups}},
author = {Matteo Tarocchi},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05255},
eprint = {2610.05255},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05255},
}
RIS
TY - UNPB
TI - Conjugacy and period in symmetric diagram groups
AU - Matteo Tarocchi
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2610.05255
UR - https://arxiv.org/abs/2610.05255
AB - We show how to solve the conjugacy (search) problem and the problem of determining whether a given element is periodic in symmetric diagram groups based on finite semigroup presentations.
ER -