Congruence lattices of finite diagram monoids
MetadataShow full item record
We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley–Lieb monoid), the Motzkin monoid, and the partial Brauer monoid. All the congruences under discussion arise as special instances of a new construction, involving an ideal I , a retraction I → M onto the minimal ideal, a congruence on M, and a normal subgroup of a maximal subgroup outside I.
East , J , Mitchell , J D , Ruskuc , N & Torpey , M 2018 , ' Congruence lattices of finite diagram monoids ' , Advances in Mathematics , vol. 333 , pp. 931-1003 . https://doi.org/10.1016/j.aim.2018.05.016
Advances in Mathematics
© 2018 Elsevier Ltd. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1016/j.aim.2018.05.016
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Showing items related by title, author, creator and subject.
Wilson, Wilf A. (University of St Andrews, 2019-06-25) - ThesisA semigroup is simply a set with an associative binary operation; computational semigroup theory is the branch of mathematics concerned with developing techniques for computing with semigroups, as well as investigating ...
East, James; Kumar, Jitender; Mitchell, James D.; Wilson, Wilf A. (2018-06-15) - Journal articleWe describe and count the maximal subsemigroups of many well-known transformation monoids, and diagram monoids, using a new unified framework that allows the treatment of several classes of monoids simultaneously. The ...
Counting subwords and other results related to the generalised star-height problem for regular languages Bourne, Thomas (University of St Andrews, 2017-12-07) - ThesisThe Generalised Star-Height Problem is an open question in the field of formal language theory that concerns a measure of complexity on the class of regular languages; specifically, it asks whether or not there exists an ...