Deciding conjugacy in sylvester monoids and other homogeneous monoids

DOI10.1142/S0218196715500241zbMath1330.20082arXiv1404.2618OpenAlexW1846682464MaRDI QIDQ2942806

Alan J. Cain, António Malheiro

Publication date: 11 September 2015

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.2618

zbMATH Keywords

conjugacydecidabilitybinary search treeshomogeneous monoidsSylvester monoids

Mathematics Subject Classification ID

Trees (05C05) General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Turing machines and related notions (03D10)

Related Items (2)

Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) ⋮ Combinatorics of cyclic shifts in plactic, hypoplactic, Sylvester, Baxter, and related monoids

Cites Work

• Unnamed Item
• The algebra of binary search trees
• Conjugacy in monoids with a special Church-Rosser presentation is decidable
• On three approaches to conjugacy in semigroups.
• Complexity results on the conjugacy problem for monoids
• The problems of cyclic equality and conjugacy for finite complete rewriting systems
• Hopf algebra of the planar binary trees
• Conjugation in semigroups.
• CONJUGACY IN FREE INVERSE MONOIDS
• CONJUGACY AND TRANSPOSITION FOR INVERSE MONOID PRESENTATIONS
• THE CHINESE MONOID
• Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids

This page was built for publication: Deciding conjugacy in sylvester monoids and other homogeneous monoids