THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID Mk, 1 AND THEIR COMPLEXITY
From MaRDI portal
Publication:3580222
DOI10.1142/S0218196710005741zbMath1206.20064arXiv0812.4434OpenAlexW2963305880MaRDI QIDQ3580222
Publication date: 11 August 2010
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.4434
computational complexitydecision problemsGreen relationsfinite generating setsThompson-Higman monoids
Free semigroups, generators and relations, word problems (20M05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
ON THE CIRCUIT-SIZE OF INVERSES ⋮ A countable series of bisimple \(\mathcal H\)-trivial finitely presented congruence-free monoids. ⋮ THE THOMPSON–HIGMAN MONOIDS Mk,i: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY ⋮ A strong geometric hyperbolicity property for directed graphs and monoids. ⋮ Monoids that map onto the Thompson-Higman groups ⋮ A countable family of finitely presented infinite congruence-free monoids ⋮ Semigroups and one-way functions ⋮ A simple non-bisimple congruence-free finitely presented monoid.
Cites Work
- A construction which can be used to produce finitely presented infinite simple groups
- Monoid generalizations of the Richard Thompson groups.
- One-way permutations, computational asymmetry and distortion.
- Groups of piecewise linear homeomorphisms of the real line
- The Chameleon groups of Richard J. Thompson: Automorphisms and dynamics
- FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
- The Ubiquity of Thompson's Group F in Groups of Piecewise Linear Homeomorphisms of the Unit Interval
- THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
