In [1] we introduced the concept of restricted representations for an inverse semigroup S and studied the restricted forms of some important Banach algebras on S. In this paper, we continue our study by considering the relation between the restricted positive definite functions and retricted representations. In particular, we prove restricted versions of the Godement’s characterization of the p...

Abstract A semigroup generated by two dimensional C contracting maps is considered. We call a such semigroup regular if the maximum K of the conformal dilatations of generators, the maximum l of the norms of the derivatives of generators and the smoothness α of the generators satisfy a compatibility condition K < 1/l. We prove that the shape of the image of the core of a ball under any element ...

We consider a version of the notion of F -inverse semigroup (studied in the algebraic theory of inverse semigroups). We point out that an action of such an inverse semigroup on a locally compact space has associated a natural groupoid construction, very similar to the one of a transformation group. We discuss examples related to Toeplitz algebras on subsemigroups of discrete groups, to Cuntz-Kr...

We study inverse semigroup amalgams [S1, S2;U ], where S1 and S2 are finitely presented inverse semigroups with decidable word problem and U is an inverse semigroup with decidable membership problem in S1 and S2. We use a modified version of Bennett’s work on the structure of Schützenberger graphs of the R-classes of S1 ∗U S2 to state sufficient conditions for the amalgamated free products S1 ∗...

The purpose of this note is to obtain some properties of (∈,∈ ∨q)fuzzy bi-ideals in a Γ-semigroup in order to characterize regular and intra-regular Γ-semigroups. Keywords—Regular Γ-semigroup, belong to or quasi-coincident, (∈,∈ ∨q)-fuzzy subsemigroup, (∈,∈ ∨q)-fuzzy bi-ideals.

In this paper it is shown how the graphical methods developed by Stephen for analyzing inverse semigroup presentations may be used to study varieties of inverse semigroups. In particular, these methods may be used to solve the word problem for the free objects in the variety of inverse semigroups generated by the five-element combinatorial Brandt semigroup and in the variety of inverse semigrou...

We argue that weak containment is an appropriate notion of amenability for inverse semigroups. Given an inverse semigroup S and a homomorphism φ of S onto a group G, we show, under an assumption on ker(φ), that S has weak containment if and only if G is amenable and ker(φ) has weak containment. Using Fell bundle amenability, we find a related result for inverse semigroups with zero. We show tha...

Walking automata, be they running over words, trees or even graphs, possibly extended with pebbles that can be dropped and lifted on vertices, have long been defined and studied in Computer Science. However, questions concerning walking automata are surprisingly complex to solve. In this paper, we study a generic notion of walking automata over graphs whose semantics naturally lays within inver...