A remark on contracting inverse semigroups
classification
🧮 math.OA
math.CO
keywords
contractingconditioninversesemi-latticetree-likeactionsauthorcloser
read the original abstract
A semi-lattice is said to be tree-like when any two of its elements are either orthogonal or comparable. Given an inverse semigroup S whose idempotent semi-lattice is tree-like, and such that all tight filters are ultra-filters, we present a necessary and sufficient condition for S to be contracting which looks closer in spirit to the notion of contracting actions than a recent condition found by the second named author and E. Pardo.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.