Deciding conjugacy in sylvester monoids and other homogeneous monoids
Group Theory
2017-06-23 v2
Abstract
We give a combinatorial characterization of conjugacy in the sylvester monoid (the monoid of binary search trees), showing that conjugacy is decidable for this monoid. We then prove that conjugacy is undecidable in general for homogeneous monoids and even for multihomogeneous monoids.
Keywords
Cite
@article{arxiv.1404.2618,
title = {Deciding conjugacy in sylvester monoids and other homogeneous monoids},
author = {Alan J. Cain and António Malheiro},
journal= {arXiv preprint arXiv:1404.2618},
year = {2017}
}
Comments
16 pages, 4 figures. Minor revisions and improvements