We generalise the classical Munn representation of an inverse semigroup with the introduction of what we call ordered representations of inverse semigroups. Both the WagnerแPreston Representation and the effective actions of O'Carroll and McAlister are examples of such representations. We show that
On a Class of Lattice Ordered Inverse Semigroups
โ Scribed by Gracinda M.S. Gomes; Emilia Giraldes; Donald B. McAlister
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 150 KB
- Volume
- 230
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
โฆ Synopsis
It is well known that the free group on a non-empty set can be totally ordered and, further, that each compatible latttice ordering on a free group is a total ordering. On the other hand, Saitรด has shown that no non-trivial free inverse semigroup can be totally ordered. In this note we show, however, that every free inverse monoid admits compatible lattice orderings which are closely related to the total orderings on free groups.
These orderings are natural in the sense that the imposed partial ordering on the idempotents coincides with the natural partial ordering. For this to happen in a lattice ordered inverse semigroup, the idempotents must form a distributive lattice. The method of construction of the lattice orderings on free inverse monoids can be applied to show that naturally lattice ordered inverse semigroups with a given distributive lattice E of idempotents can have arbitrary Green's relation structure.
496
๐ SIMILAR VOLUMES
We give a sufficient condition for a finitely presented Rees quotient of a free inverse semigroup to have rational growth. Using related techniques we give a new proof that nonmonogenic free inverse semigroups have irrational growth. A new criterion for polynomial growth is proved and is used to sho
The generalized Moยจbius function and Moยจbius inversion formula are applied to a multiplicative semigroup. A general mathematical method based on this Moยจbius inversion is presented to solve inversion problems of expansions with unequally weighted terms. By this method, all the inverse lattice proble
A lattice-ordered abelian group is called ultrasimplicial iff every finite set of positive elements belongs to the monoid generated by some finite set of positive Z-independent elements. This property originates from Elliott's classification of AF C U -algebras. Using fans and their desingularizatio
## Given a permutation x n โ S. Various permutability conditions were considered for special classes of permutations. We define the permutability class of a semigroup S to be the infinite sequence The aim of this paper is to give a description of such sequences, which generalizes a number of old