Related papers: On graph products of monoids

We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…

We investigate the structure of subdirect products of groups, particularly their finiteness properties. We pay special attention to the subdirect products of free groups, surface groups and HNN extensions. We prove that a finitely presented…

We study the categorical properties of right-preordered groups, giving an explicit description of limits and colimits in this category, and studying some exactness properties. We show that, from an algebraic point of view, the category of…

Dujmovi\'{c}, Joret, Micek, Morin, Ueckerdt, and Wood [J. ACM 2020] established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically…

Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…

Two fundamental constructions operating on residuated lattices and partially ordered monoids (pomonoids) are so-called nuclear images and conuclear images. Nuclear images allow us to construct many of the ordered algebras which arise in…

We investigate criteria ensuring that a one-relator group $G$ contains a right-angled Artin subgroup $A(\Gamma)$, corresponding to a finite graph $\Gamma$. In particular, we prove that if $\Gamma$ is a forest with at least one edge and the…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. From an arbitrary basis $\mathcal B$ of $H^1(A(\Gamma),\mathbb F)$ over an arbitrary field, we construct a natural graph $\Gamma_{\mathcal B}$…

We prove that the set of orders of finite quotients of a finitely generated group has natural density 0, 1/2 or 1, and characterise when each of these cases occurs. We apply this to show that the sets of orders of various families of…

A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…

The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…

A graph is well-dominated if all its minimal dominating sets have the same cardinality. In this paper we prove that at least one factor of every connected, well-dominated Cartesian product is a complete graph, which then allows us to give a…

The purpose of this paper is to show that various convolution products are fully homotopical, meaning that they preserve weak equivalences in both variables without any cofibrancy hypothesis. We establish this property for diagrams of…

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

For a simple algebraic group $G$ over an algebraically closed field, we study products of normal subsets. For this we mark the nodes of the Dynkin diagram of $G$. We use two types of labels, a binary marking and a labeling with non-negative…

We explore monoids generated by operators on certain infinite partial orders. Our starting point is the work of Fomin and Greene on monoids satisfying the relations $(\u{r}+\u{r+1})\u{r+1}\u{r}=\u{r+1}\u{r}(\u{r}+\u{r+1})$ and…

We consider certain decision problems for the free model of the theory of Cartesian monoids. We introduce a model of computation based on the notion of a single stack one-way PDA due to Ginsburg, Greibach and Harrison. This model allows us…

In this work we prove that, given a simplicial graph $\Gamma$ and a family $\mathcal{G}$ of linear groups over a domain $R$, the graph product $\Gamma\mathcal{G}$ is linear over $R[\underline t]$, where $\underline t$ is a tuple of finitely…

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

Given a finite simplicial graph $\Gamma=(V,E)$ with a vertex-labelling $\varphi:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}$, the graph product $G_\Gamma$ is the free product of the vertex groups $\varphi(v)$…