Deciding conjugacy in sylvester monoids and other homogeneous monoids
classification
🧮 math.GR
keywords
conjugacymonoidsmonoidhomogeneoussylvesterbinarycharacterizationcombinatorial
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.