Monoid generalizations of the Richard Thompson groups.

DOI10.1016/J.JPAA.2008.06.012MaRDI QIDQ958127zbMATH OpenOpenAlexFDO

Authors J.-C. Birget

Publication date 2 December 2008

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

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

zbMATH Keywords

generating setsword problemGreen relationsThompson groupsCuntz algebrasinverse monoidsfinitely generated monoidscongruence-simple monoids

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18)

Abstract: The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or partial injective functions. The monoids M_{k,1} have connections with circuit complexity (studied in another paper). Here we prove that M_{k,1} and Inv_{k,1} are congruence-simple for all k. Their Green relations J and D are characterized: M_{k,1} and Inv_{k,1} are J-0-simple, and they have k-1 non-zero D-classes. They are submonoids of the multiplicative part of the Cuntz algebra O_k. They are finitely generated, and their word problem over any finite generating set is in P. Their word problem is coNP-complete over certain infinite generating sets. Changes in this version: Section 4 has been thoroughly revised, and errors have been corrected; however, the main results of Section 4 do not change. Sections 1, 2, and 3 are unchanged, except for the proof of Theorem 2.3, which was incomplete; a complete proof was published in the Appendix of reference [6], and is also given here.

Recommendations

• 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.
• THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
• FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
• Higher dimensional generalizations of the Thompson groups

Cites work

• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3670685 (Why is no real title available?)
• scientific article; zbMATH DE number 3448564 (Why is no real title available?)
• scientific article; zbMATH DE number 774488 (Why is no real title available?)
• scientific article; zbMATH DE number 3214018 (Why is no real title available?)
• A construction which can be used to produce finitely presented infinite simple groups
• An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
• CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
• Combinatorial and metric properties of Thompson’s group 𝑇
• Cuntz-Pimsner algebras of group actions
• Diagram groups
• FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
• Geometric presentations for Thompson's groups.
• Groups of piecewise linear homeomorphisms of the real line
• Introductory notes on Richard Thompson's groups
• One-way permutations, computational asymmetry and distortion.
• Orthogonal Completions of the Polycyclic Monoids
• Simple \(C^*\)-algebras generated by isometries
• Subgroups of finitely presented groups
• Sur un groupe remarquable de difféomorphismes du cercle. (On a remarkable group of the diffeomorphisms of the circle)
• THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
• The Chameleon groups of Richard J. Thompson: Automorphisms and dynamics
• The co-word problem for the Higman-Thompson group is context-free
• Trees, ultrametrics, and noncommutative geometry

Cited in

(19)

• The \(\mathcal R\)- and \(\mathcal L\)-orders of the Thompson-Higman monoid \(M_{k,1}\) and their complexity.
• The Thompson-Higman monoids \(M_{k,i}\): the \(\mathcal J\)-order, the \(\mathcal D\)-relation, and their complexity.
• CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
• THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
• Bernoulli measure on strings, and Thompson-Higman monoids.
• Monoids that map onto the Thompson-Higman groups
• Polynomial-time right-ideal morphisms and congruences
• FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
• The polycyclic inverse monoids and the Thompson groups revisited
• A countable series of bisimple \(\mathcal H\)-trivial finitely presented congruence-free monoids.
• The Polycyclic MonoidsP_nand the Thompson GroupsV_n,1
• The word problem of the Brin-Thompson group is \textsf{coNP}-complete
• Generalizations of free monoids
• A countable family of finitely presented infinite congruence-free monoids
• A simple non-bisimple congruence-free finitely presented monoid.
• Products in a category with only one object
• Higher dimensional generalizations of the Thompson groups
• Semigroups and one-way functions
• scientific article; zbMATH DE number 5850874 (Why is no real title available?)

This page was built for publication: Monoid generalizations of the Richard Thompson groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958127)