A countable family of finitely presented infinite congruence-free monoids

DOI10.14232/actasm-013-028-zzbMath1363.20044arXiv1304.4687OpenAlexW2962941830MaRDI QIDQ2834201

Fatma Ahmed Al-Kharousi, Alan J. Cain, Victor Maltcev, Abdullahi Umar

Publication date: 25 November 2016

Published in: Acta Scientiarum Mathematicarum (Search for Journal in Brave)

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

zbMATH Keywords

rewriting systemsfinitely presentedcongruence-free monoidBoone-Higman conjecture

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05)

Related Items

A countable series of bisimple \(\mathcal H\)-trivial finitely presented congruence-free monoids. ⋮ A simple non-bisimple congruence-free finitely presented monoid.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monoids that map onto the Thompson-Higman groups
• Bernoulli measure on strings, and Thompson-Higman monoids.
• A finitely presented simple group with unsolvable conjugacy problem
• Embedding any countable semigroup in a 2-generated congruence-free semigroup
• Monoid generalizations of the Richard Thompson groups.
• Constructing finitely presented simple groups that contain Grigorchuk groups
• Finite semigroups embed in finitely presented congruence-free monoids.
• A countable series of bisimple \(\mathcal H\)-trivial finitely presented congruence-free monoids.
• THE THOMPSON–HIGMAN MONOIDS M_k,i: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY
• THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M_{k, 1} AND THEIR COMPLEXITY
• An algebraic characterization of groups with soluble word problem