We study the asymptotic behaviour of a finitely presented Rees quotient S = Inv〈A | ci = 0 (i = 1, . . . , k) 〉 of a free inverse semigroup over a finite alphabet A. It is shown that if the semigroup S has polynomial growth then S is monogenic (with zero) or k ≥ 3. The three relator case is fully characterised, yielding a sequence of two-generated three-relator semigroups whose Gelfand-Kirillov...

let tx be the full transformation semigroups on the set x. for an equivalence e on x, let te(x) = {α ∈ tx : ∀(x, y) ∈ e ⇔ (xα, yα) ∈ e}it is known that te(x) is a subsemigroup of tx. in this paper, we discussthe green's *-relations, certain *-ideal and certain rees quotient semigroup for te(x).

Semigroups whose congruences form a chain are often termed ∆-semigroups. The commutative ∆-semigroups were determined by Schein and by Tamura. A natural generalization of commutativity is permutativity: a semigroup is permutative if it satisfies a non-identity permutational identity. We completely determine the permutative ∆-semigroups. It turns out that there are only six noncommutative exampl...

We consider a nonstandard odd reduction of supermatrices (as compared with the standard even one) which arises in connection with possible extension of manifold structure group reductions. The study was initiated by consideration of the generalized noninvertible superconformal-like transformations. The features of evenand oddreduced supermatrices are investigated on a par. They can be unified i...

Given a word w over a finite alphabet, we consider, in three special cases, the generalised star-height of the languages in which w occurs as a contiguous subword (factor) an exact number of times and of the languages in which w occurs as a contiguous subword modulo a fixed number, and prove that in each case it is at most one. We use these combinatorial results to show that any language recogn...

A semigroup S is said to have the compactness property, or CP for short, if each system of equations over a nite set of variables has an equivalent nite subsystem, that is, having exactly the same solutions in S. We prove that a completely 0-simple semigroup S satis es CP if and only if the group G in a Rees matrix representation S = M0(I; G; ;P) satis es this property. Further, a variety of co...

Exactly as in semigroups, Green’s relations play an important role in the theory of ordered semigroups—especially for decompositions of such semigroups. In this paper we deal with the -trivial ordered semigroups which are defined via the Green’s relation , and with the nil and Δ-ordered semigroups. We prove that every nil ordered semigroup is -trivial which means that there is no ordered semigr...

In this paper we combine results from [1] and [3] in order to determine the relationship between the deficiency of a group G and the deficiency of a Rees matrix semigroup S over G; in particular, we investigate how the efficiency of S depends on the efficiency of G. We start by defining semigroup and group presentations. Let A be an alphabet. We denote by A the free semigroup on A consisting of...