Minimal paths in the commuting graphs of semigroups

Abstract: Let

S

be a finite non-commutative semigroup. The commuting graph of

S

, denoted

c g (S)

, is the graph whose vertices are the non-central elements of

S

and whose edges are the sets

a, b

of vertices such that

a e b

and

a b = b a

. Denote by

T (X)

the semigroup of full transformations on a finite set

X

. Let

J

be any ideal of

T (X)

such that

J

is different from the ideal of constant transformations on

X

. We prove that if

| X | g e q 4

, then, with a few exceptions, the diameter of

c g (J)

is 5. On the other hand, we prove that for every positive integer

n

, there exists a semigroup

S

such that the diameter of

c g (S)

is

n

. We also study the left paths in

c g (S)

, that is, paths

a_{1} - a_{2} - ... - a_{m}

such that

a_{1} e a_{m}

and

a_{1} a_{i} = a_{m} a_{i}

for all

i i n 1, l d o t, m

. We prove that for every positive integer

n g e q 2

, except

n = 3

, there exists a semigroup whose shortest left path has length

n

. As a corollary, we use the previous results to solve a purely algebraic old problem posed by B.M. Schein.

Recommendations

Cites work

Cited in

(33)

Describes a project that uses

Uses Software

This page was built for publication: Minimal paths in the commuting graphs of semigroups