  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.
