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

Mark V. Lawson

doi:10.1080/00927870701511400

The polycyclic monoids P_n and the thompson groups V _n,1

Mark V. Lawson

Research output: Contribution to journal › Article › peer-review

22 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	4068-4087
Number of pages	20
Journal	Communications in Algebra
Volume	35
Issue number	12
DOIs	https://doi.org/10.1080/00927870701511400
Publication status	Published - Dec 2007

Keywords

Polycyclic inverse monoids
Prefix codes
Thompson groups

Access to Document

10.1080/00927870701511400

Cite this

@article{9d16f29dc51746899eea08148ace7d47,

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

abstract = "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.",

keywords = "Polycyclic inverse monoids, Prefix codes, Thompson groups",

author = "Lawson, {Mark V.}",

year = "2007",

month = dec,

doi = "10.1080/00927870701511400",

language = "English",

volume = "35",

pages = "4068--4087",

journal = "Communications in Algebra",

issn = "0092-7872",

publisher = "Taylor & Francis",

number = "12",

}

TY - JOUR

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

AU - Lawson, Mark V.

PY - 2007/12

Y1 - 2007/12

N2 - 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.

AB - 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.

KW - Polycyclic inverse monoids

KW - Prefix codes

KW - Thompson groups

UR - http://www.scopus.com/inward/record.url?scp=37249064827&partnerID=8YFLogxK

U2 - 10.1080/00927870701511400

DO - 10.1080/00927870701511400

M3 - Article

SN - 0092-7872

VL - 35

SP - 4068

EP - 4087

JO - Communications in Algebra

JF - Communications in Algebra

IS - 12

ER -

The polycyclic monoids P_n and the thompson groups V _n,1

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this