Cayley Graphs
A semigroup is a set with a closed and associative binary operation. One can generate a semigroup by taking elements in a generating set and repeatedly multiplying them. One can make a right cayley graph, which is a directed graph, by taking as vertex set the elements of S --- factored in terms of the generators --- and adjoining vertices if there exists in the generating set such that . Similarly, one can make the left cayley graph, by adjoing vertices if there exists in the generating set such that .
Define your semigroup creating a Froidure-Pin class, and placing generating elements in the function. The following produces a group.
This is the right cayley graph of S.
This is the left cayley graph of S.
Cayley graphs of transformations
The following semigroups and cayley graph were made in the notes. We construct it here.
So left and right cayley graphs of semigroups can look very different!