Related papers: On graph products of monoids

Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…

Given two convex polytopes, the join, the cartesian product and the direct sum of them are well understood. In this paper we extend these three kinds of products to abstract polytopes and introduce a new product, called the topological…

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…

Let G be a finite group that acts on an abelian monoid A. If f: A -> G is a map so that f(a f(a)(b)) = f(a)f(b), for all a, b in A, then the submonoid S = {(a, f(a)) | a in A} of the associated semidirect product of A and G is said to be a…

In this paper, we study the dot-product graphs in $\mathbb{F}_q^d$. We prove that if the size of the product of two adjacent sets is large enough, then the set of dot-product graphs has positive density. Our method is based on finite field…

Finite-above inverse monoids are a common generalization of finite inverse monoids and Margolis--Meakin expansions of groups. Given a finite-above $E$-unitary inverse monoid $M$ and a group variety $\mathit{U}$, we find a condition for $M$…

A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong product graphs. We fully characterize well-edge-dominated…

We characterize, in terms of elementary properties, the abelian monoids which are direct limits of finite direct sums of monoids of the form $(Z/nZ)\sqcup\{0\}$ (where 0 is a new zero element), for positive integers $n$. The key properties…

We investigate the preservation of the properties of being finitely generated and finitely presented under both direct and wreath products of monoid acts. A monoid $M$ is said to preserve property $\mathcal{P}$ in direct products if, for…

Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…

A graph $G$ is well-covered if all maximal independent sets of $G$ have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have nontrivial factorizations with respect to some of the…

A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

In this paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…

The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…

A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…

For each $n \in \mathbb{N} \cup \{\infty\}$, diagrammatic sets admit a model structure whose fibrant objects are the diagrammatic $(\infty, n)$- categories. They also support a notion of Gray product given by the Day convolution of a…