Search results
Results from the WOW.Com Content Network
In graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs G 1 and G 2 and produces a graph H with the following properties: The vertex set of H is the Cartesian product V ( G 1 ) × V ( G 2 ) , where V ( G 1 ) and V ( G 2 ) are the vertex sets of G 1 and G 2 , respectively.
Its unit element is the class of the ordinary 2-sphere. Furthermore, if a denotes the class of the torus, and b denotes the class of the projective plane, then every element c of the monoid has a unique expression in the form c = na + mb where n is a positive integer and m = 0, 1, or 2. We have 3b = a + b.
A monoid object in the category of monoids (with the direct product of monoids) is just a commutative monoid. This follows easily from the Eckmann–Hilton argument. A monoid object in the category of complete join-semilattices Sup (with the monoidal structure induced by the Cartesian product) is a unital quantale.
Ordinary monoids are precisely the monoid objects in the cartesian monoidal category Set. Further, any (small) strict monoidal category can be seen as a monoid object in the category of categories Cat (equipped with the monoidal structure induced by the cartesian product).
M. Kilp, U. Knauer, A.V. Mikhalev, Monoids, Acts and Categories with Applications to Wreath Products and Graphs, De Gruyter Expositions in Mathematics vol. 29, Walter de Gruyter, 2000, ISBN 3-11-015248-7. Ronald V. Book and Friedrich Otto, String-rewriting Systems, Springer, 1993, ISBN 0-387-97965-4, chapter 7, "Algebraic Properties"
Pages in category "Graph products" The following 12 pages are in this category, out of 12 total. This list may not reflect recent changes. ...
In abstract algebra, the free monoid on a set is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from that set, with string concatenation as the monoid operation and with the unique sequence of zero elements, often called the empty string and denoted by ε or λ, as the identity element.
History monoids were first presented by M.W. Shields. [1] History monoids are isomorphic to trace monoids (free partially commutative monoids) and to the monoid of dependency graphs. As such, they are free objects and are universal. The history monoid is a type of semi-abelian categorical product in the category of monoids.