Minimal paths in the commuting graphs of semigroups

Details Minimal paths in the commuting graphs of semigroups Minimal paths in the commuting graphs of semigroups

2010-03-14

arxiv.org/abs/1003.2809v3

European J. Combinatorics 32 (2011), no. 2, 178-197

Mathematics

Group Theory

23 pages; v.2: Lemma 2.1 corrected; v.3: final version to appear in European J. of Combinatorics

Scientific paper

Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(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\ne b$ and $ab=ba$. 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|\geq4$, then, with a few exceptions, the diameter of $\cg(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 $\cg(S)$ is $n$. We also study the left paths in $\cg(S)$, that is, paths $a_1-a_2-...-a_m$ such that $a_1\ne a_m$ and $a_1a_i=a_ma_i$ for all $i\in \{1,\ldot, m\}$. We prove that for every positive integer $n\geq2$, 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.

Affiliated with

Also associated with

No associations

Rating

Minimal paths in the commuting graphs of semigroups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal paths in the commuting graphs of semigroups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal paths in the commuting graphs of semigroups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213677