The Polycyclic MonoidsPnand the Thompson GroupsVn,1
From MaRDI portal
Publication:5436327
DOI10.1080/00927870701511400zbMath1144.20040MaRDI QIDQ5436327
Publication date: 14 January 2008
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00927870701511400
groups of units; prefix codes; Thompson groups; orthogonal completions; polycyclic inverse monoids; strong completions
20E32: Simple groups
20F05: Generators, relations, and presentations of groups
20M05: Free semigroups, generators and relations, word problems
20M18: Inverse semigroups
Related Items
NON-COMMUTATIVE STONE DUALITY: INVERSE SEMIGROUPS, TOPOLOGICAL GROUPOIDS AND C*-ALGEBRAS, Invariant means on Boolean inverse monoids, AF inverse monoids and the structure of countable MV-algebras, Graph inverse semigroups: their characterization and completion., Monoids that map onto the Thompson-Higman groups, Primitive partial permutation representations of the polycyclic monoids and branching function systems., Tarski monoids: Matui's spatial realization theorem, Higher dimensional generalizations of the Thompson groups, The Booleanization of an inverse semigroup, A perspective on non-commutative frame theory, On strong affine representations of the polycyclic monoids, Strong representations of the polycyclic inverse monoids: cycles and atoms., Pseudogroups and their étale groupoids., Subgroups of the group of homeomorphisms of the Cantor space and a duality between a class of inverse monoids and a class of Hausdorff étale groupoids, A NONCOMMUTATIVE GENERALIZATION OF STONE DUALITY
Cites Work
- Unnamed Item
- A construction which can be used to produce finitely presented infinite simple groups
- Groupoids, inverse semigroups, and their operator algebras
- Constructing inverse semigroups from category actions
- A CORRESPONDENCE BETWEEN BALANCED VARIETIES AND INVERSE MONOIDS
- Orthogonal Completions of the Polycyclic Monoids
- CONGRUENCE-FREE INVERSE SEMIGROUPS
- THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY