The polycyclic monoids Pn and the thompson groups V n,1

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


We construct what we call the strong orthogonal completion Cn of the polycyclic monoid Pn on n generators. The inverse monoid Cn is congruence free and its group of units is the Thompson group Vn,1. Copies of Cn can be constructed from partitions of sets into n blocks each block having the same cardinality as the underlying set.

Original languageEnglish
Pages (from-to)4068-4087
Number of pages20
JournalCommunications in Algebra
Issue number12
Publication statusPublished - Dec 2007


  • Polycyclic inverse monoids
  • Prefix codes
  • Thompson groups


Dive into the research topics of 'The polycyclic monoids P<sub>n</sub> and the thompson groups V <sub>n,1</sub>'. Together they form a unique fingerprint.

Cite this