Schützenberger graph
Let be a presentation![]()
for the inverse
![]()
monoid [resp. inverse semigroup ]. In what follows, the argument for inverse semigroups and inverse monoids is exactly the same, so we concentrate on the last one.
Given , let be the equivalence class![]()
of with respect to the Right Green relation . The Right Schützenberger graph of with respect to the presentation is defined as the -inverse word graph with vertex and edge set respectively
where , i.e. is the congruence generated by and the Wagner congruence , and is the congruence class of the letter with respect to the congruence .
This is a good definition, in fact it can be easily shown that given with we have .
Analogously we can define the Left Schützenberger graph using the Left Green relation instead of the Right Green relation , but this notion is not used in literature.
Schützenberger graphs play in combinatorial inverse semigroups theory the role that Cayley graphs![]()
play in combinatorial group theory. In fact, if happen to be a group (with identity ), then the Schützenberger graph of its unique -class is exactly the Cayley graph of the group .
References
- 1 N. Petrich, Inverse Semigroups, Wiley, New York, 1984.
-
2
J.B. Stephen, Presentation of inverse monoids, J. Pure Appl. Algebra

63 (1990) 81-112.
| Title | Schützenberger graph |
|---|---|
| Canonical name | SchutzenbergerGraph |
| Date of creation | 2013-03-22 16:10:50 |
| Last modified on | 2013-03-22 16:10:50 |
| Owner | Mazzu (14365) |
| Last modified by | Mazzu (14365) |
| Numerical id | 34 |
| Author | Mazzu (14365) |
| Entry type | Definition |
| Classification | msc 20M05 |
| Classification | msc 20M18 |
| Related topic | MunnTree |
| Defines | Schützenberger graph |
| Defines | left Schützenberger graph |
| Defines | right Schützenberger graph |