Related papers: On graph products of monoids
In this paper we study a new product of graphs called {\em tight product}. A graph $H$ is said to be a tight product of two (undirected multi) graphs $G_1$ and $G_2$, if $V(H)=V(G_1)\times V(G_2)$ and both projection maps $V(H)\to V(G_1)$…
We prove necessary and sufficient conditions for when graph wreath products are residually finite, generalising known results for the permutational wreath product and free product cases.
Almost-direct products of free groups arise naturally in braid theory and in the study of automorphism groups of free groups. Although bi-invariant orderings are known to exist for many such groups, their explicit structure is often left…
In this paper we study a group G which is the quotient of a free product of groups by the normal closure of a word that is contained in a in a subgroup which has the form of a generalised triangle group. We use known properties of…
In this paper we show that the Day monoidal product generalises in a straightforward way to other algebraic constructions and partial algebraic constructions on categories. This generalisation was motivated by its applications in logic, for…
We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…
Given a connected graph $G$, the total mutual-visibility number of $G$, denoted $\mu_t(G)$, is the cardinality of a largest set $S\subseteq V(G)$ such that for every pair of vertices $x,y\in V(G)$ there is a shortest $x,y$-path whose…
We give an elementary characterization of those (abelian) semigroups $M$ that are direct limits of countable sequences of finite direct products of monoids of the form $C\cup\{0\}$ for monogenic groups $C$. This characterization involves…
We study classes of proper restriction semigroups determined by properties of partial actions underlying them. These properties include strongness, antistrongness, being defined by a homomorphism, being an action etc. Of particular interest…
In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor…
We take a general approach to uncertainty on product spaces, and give sufficient conditions for the independence structures of uncertainty measures to satisfy graphoid properties. Since these conditions are arguably more intuitive than some…
Stable basis algebras were introduced by Fountain and Gould and developed in a series of articles. They form a class of universal algebras, extending that of independence algebras. If a stable basis algebra $\mathbb{B}$ of finite rank…
This article presents a machinery based on polyhedral products that produces faithful representations of graph products of finite groups and direct products of finite groups into automorphisms of free groups $\rm Aut(F_n)$ and outer…
A function on an algebra is congruence preserving if, for any congruence, it maps congruent elements to congruent elements. We show that, on a free monoid generated by at least 3 letters, a function from the free monoid into itself is…
We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…
The chromatic functor of a simple graph is a functorization of the chromatic polynomial. M. Yoshinaga showed in \cite{Yoshinaga2015} that two finite graphs have isomorphic chromatic functors if and only if they have the same chromatic…
In this paper, we study geodesic growth of numbered graph products; these are a generalization of right-angled Coxeter groups, defined as graph products of finite cyclic groups. We first define a graph-theoretic condition called…
We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.
An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…