Graphical strong representations of monoids

MaRDI QIDQ4527152zbMATH OpenFDO

Authors Suohai Fan

Publication date 10 July 2001

zbMATH Keywords

direct productsfinite regular monoidsgraphical strong representationsgraphsstrong endomorphismswreath products

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph representations (geometric and intersection representations, etc.) (05C62) Semigroups of transformations, relations, partitions, etc. (20M20) Representation of semigroups; actions of semigroups on sets (20M30) Connections of semigroups with homological algebra and category theory (20M50)

Review text

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].

Recommendations

• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Graphs whose strong endomorphism monoids are regular
• scientific article; zbMATH DE number 5274497
• scientific article; zbMATH DE number 1159832
• REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS

Cited in

(3)

• Generalized symmetry of graphs - a survey
• Strong representations of the polycyclic inverse monoids: cycles and atoms.
• Generalized symmetry of graphs

This page was built for publication: Graphical strong representations of monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527152)