Skip to content
DraconiticResearch
Search Sources API
186,625 studies31 sourcesUpdated 17 min ago
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

  1. Tilings of symmetric and alternating groups by conjugacy classes
    Gábor Somlai, Binzhou Xia, Sanming Zhou
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. The Complexity of Conjugacy, Orbit Equivalence, and von Neumann Equivalence of Actions of Nonamenable Groups
    Eusebio Gardella, Martino Lupini
    Memoirs of the American Mathematical SocietyPeer-reviewedLicence not statedFull text6 citedMathematical physicsOpenAlex
  3. Local conjugacy in prosolvable groups
    Michael C. Burkhart
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Sylow $2$-Subgroups of Finite Groups with a Single Conjugacy Class of Involutions
    Tianze Li, Yu Zeng
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Irrationality of the conjugacy growth on Heisenberg groups
    Lukas Vandeputte
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
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  -