Related papers: Green's Relations in Finite Transformation Semigro…

Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…

We prove new results on inheritance of Green's relations by subsemigroups in the presence of stability of elements. We provide counterexamples in other cases to show in particular that not all right-stable semigroups are embeddable in…

We establish key connections between Green's $\cal J$- and $\cal L$-relations on a finite semigroup and the subduction relation defined on the image sets of an action of the same semigroup when it acts faithfully on a finite set. The…

For a group $G$ acting over a set $X$, the set of all the $G$-equivariant functions, i.e., the set of functions which conmute with the action, ($g\cdot f(x)=g\cdot f(x), \forall g\in G, \forall x\in X$), is a monoid with the composition.…

Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{P}_{n}$ be the semigroup of partial transformations on $[n]$. Let $\mathcal{CP}_{n}=\{\alpha\in \mathcal{P}_{n}: (for~all ~x,y\in Dom~\alpha)~|x\alpha-y\alpha|\leq|x-y|\}$, then…

In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…

We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…

Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{T}_{n}$ be the semigroup of full transformations on $[n]$. Let $\mathcal{CT}_{n}=\{\alpha\in \mathcal{T}_{n}: (for ~all~x,y\in…

Let S be a semigroup and let T be a subsemigroup of S. Then T acts on S by left- and by right multiplication. This gives rise to a partition of the complement of T in S, and to each equivalence class of this partition we naturally associate…

We consider semigroups of transformations (partial mappings defined on a set $A$) closed under the set-theoretic intersection of mappings treated as subsets of $A\times A$. On such semigroups we define two relations: the relation of…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

In this work, the lattice of varieties of semigroups and the lattice of varieties of I-semigroups (a common setting for both the variety of completely regular semigroups and the variety of inverse semigroups) are studied with respect to the…

A semigroup variety V is said to be locally K-finite, where K stands for any of Green's relations H, R, L, D, or J, if every finitely generated semigroup from V has only finitely many K-classes. We characterize locally K-finite varieties of…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A if and only if each one is a substitution instance of the other using operations from C. We study the…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…

Let $X$ be a finite or infinite chain and let $O(X)$ be the monoid of all endomorphisms of $X$. In this paper, we describe the largest regular subsemigroup of $O(X)$ and Green's relations on $O(X)$. In fact, more generally, if $Y$ is a…

In this paper we describe the Greens relations on the semigroup of bi-ideals of ordered full transformation semigroup in terms of Greens relations of ordered full transformation semigroup on a set.

We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph $G$ is accessible if and only if its set of separations of finite order is an ${\rm Aut}(G)$-finitely…

In this article we completely characterise constant length substitution shifts which have an almost automorphic factor, or which have a bijective substitution factor. Our approach is algebraic: we study these dynamical properties in terms…

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…