For a set X, an equivalence relation ρ on X, and a cross-section R of the partition X/ρ induced by ρ, consider the semigroup T(X, ρ, R) consisting of all mappings a from X to X such that a preserves both ρ (if (x, y) ∈ ρ then (xa, ya) ∈ ρ) and R (if r ∈ R then ra ∈ R). The semigroup T(X, ρ, R) is the centralizer of the idempotent transformation with kernel ρ and image R. We determine the structure of T(X, ρ, R) in terms of Green's relations, describe the regular elements of T(X, ρ, R), and determine the following classes of the semigroups T(X, ρ, R): regular, abundant, inverse, and completely regular.

/pdf/semigroups-of-transformations-preserving-an-equivalence-1yb31c72py.pdf

Semigroups of transformations preserving an equivalence relation and a cross-section

The commuting graph of a finite non-commutative semigroup S, denoted G(S), is a simple graph whose vertices are the non-central elements of S and two distinct vertices x, y are adjacent if xy = yx. Let I(X) be the symmetric inverse semigroup of partial injective transformations on a finite set X. The semigroup I(X) has the symmetric group Sym(X) of permutations on X as its group of units. In 1989, Burns and Goldsmith determined the clique number of the commuting graph of Sym(X). In 2008, Iranmanesh and Jafarzadeh found an upper bound of the diameter of G(Sym(X)), and in 2011, Dolžan and Oblak claimed that this upper bound is in fact the exact value. The goal of this paper is to begin the study of the commuting graph of the symmetric inverse semigroup I(X). We calculate the clique number of G(I(X)), the diameters of the commuting graphs of the proper ideals of I(X), and the diameter of G(I(X)) when |X| is even or a power of an odd prime. We show that when |X| is odd and divisible by at least two primes, then the diameter of G(I(X)) is either 4 or 5. In the process, we obtain several results about semigroups, such as a description of all commutative subsemigroups of I(X) of maximum order, and analogous results for commutative inverse and commutative nilpotent subsemigroups of I(X). The paper closes with a number of problems for experts in combinatorics and in group or semigroup theory.

The commuting graph of the symmetric inverse semigroup

For an arbitrary set X (finite or infinite), denote by T(X) the semigroup of full transformations on X For α∈T(X), let C(α)={β∈T(X):αβ=βα} be the centralizer of α in T(X) The aim of this paper is to characterize the elements of C(α) The characterization is obtained by decomposing α as a join of connected partial transformations on X and analyzing the homomorphisms of the directed graphs representing the connected transformations The paper closes with a number of open problems and suggestions of future investigations

/pdf/centralizers-in-the-full-transformation-semigroup-yhd1nwt234.pdf

Centralizers in the Full Transformation Semigroup

Green’s relations and regularity in centralizers of permutations

For an infinite set X, denote by Γ(X) the semigroup of all injective mappings from X to X under function composition. For α ∈ Γ(X), let C(α) = {β ∈ g/g(X): αβ = βα} be the centralizer of α in Γ(X). The aim of this paper is to determine those elements of Γ(X) whose centralizers have simple structure. We find α ∈ (X) such that various Green's relations in C(α) coincide, characterize α ∈ Γ(X) such that the 
% MathType!MTEF!2!1!+-
% feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbbjxAHX
% garmWu51MyVXgaruWqVvNCPvMCG4uz3bqefqvATv2CG4uz3bIuV1wy
% Ubqee0evGueE0jxyaibaieYdh9Lrpeeu0dXdh9vqqj-hEeeu0xXdbb
% a9frpm0db9Lqpepeea0xd9q8as0-LqLs-Jirpepeea0-as0Fb9pgea
% 0lrP0xe9Fve9Fve9qapdbaqaaeGaciGaaiaabeqaamaaeaqbaaGcba
% Wefv3ySLgznfgDOfdaryqr1ngBPrginfgDObYtUvgaiyaacqWFjeVs
% aaa!46C9!

 $$
\mathcal{J}
$$
 -classes of C(α) form a chain, and describe Green's relations in C(α) for α with so-called finite ray-cycle decomposition. If α is a permutation, we also find the structure of C(α) in terms of direct and wreath products of familiar semigroups.

J Konieczny

Papers

Centralizers in the semigroup of partial transformations