Graphical strong representations of monoids (Q4527152)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1560304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphical strong representations of monoids |
scientific article; zbMATH DE number 1560304 |
Statements
10 July 2001
0 references
graphs
0 references
strong endomorphisms
0 references
finite regular monoids
0 references
graphical strong representations
0 references
direct products
0 references
wreath products
0 references
0.8057371377944946
0 references
0.7788915634155273
0 references
0.7744718790054321
0 references
Graphical strong representations of monoids (English)
0 references
A graph \(X\) is called a graphical strong representation of a monoid \(S\) if the strong endomorphism monoid \(\text{SEnd }X\) of the graph \(X\) is isomorphic to \(S\). In this case the monoid \(S\) is said to have a graphical strong representation (GSR). The author proves the following: (i) Let \(S_1\) and \(S_2\) be two finite regular monoids. If \(S_1\) and \(S_2\) have GSR, then so does \(S_1\times S_2\). (ii) If a finite regular monoid \(S\) has a GSR, then for any finite group \(G\) the wreath product \(G[S]\) has a GSR. For the entire collection see [Zbl 0946.00017].
0 references
