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.
|Number of pages||20|
|Journal||Communications in Algebra|
|Publication status||Published - Dec 2007|
- Polycyclic inverse monoids
- Prefix codes
- Thompson groups