2014/09/29 by Giuliano Boava, Boava, Giuliano, Ruy Exel +1
Computer Science · Mathematics · #semigroups and automata theory #Advanced Algebra and Logic #Mathematical Dynamics and Fractals
paper · pdf · doi:10.48550/arxiv.1409.8334
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.