PARTIALIZATION OF CATEGORIES AND INVERSE BRAID-PERMUTATION MONOIDS

From MaRDI portal
Publication:3545893

DOI10.1142/S0218196708004731zbMATH Open1176.20062arXivmath/0610730MaRDI QIDQ3545893FDOQ3545893

Ganna Kudryavtseva, Volodymyr Mazorchuk

Publication date: 11 December 2008

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Abstract: We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently defined inverse monoids, and use it to define a new object, which we call the inverse braid-permutation monoid. A presentation for this monoid is obtained. Finally, we study some abstract properties of the partialization functor and its iterations. This leads to a categorification of a monoid of all order preserving maps, and series of orthodox generalizations of the symmetric inverse semigroup.


Full work available at URL: https://arxiv.org/abs/math/0610730





Cites Work


Cited In (9)






This page was built for publication: PARTIALIZATION OF CATEGORIES AND INVERSE BRAID-PERMUTATION MONOIDS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545893)