Related papers: On Monoid Congruences of Commutative Semigroups

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…

This paper concerns a class of semigroups that arise as products $US$, associated to what we call `action pairs'. Here $U$ and $S$ are subsemigroups of a common monoid and, roughly speaking, $S$ has an action on the monoid completion $U^1$…

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

We prove that a commutative parasemifield S is additively idempotent provided that it is finitely generated as a semiring. Consequently, every proper commutative semifield T that is finitely generated as a semiring is either additively…

Different commutative semigroups may have a common saturation. We consider distinguishing semigroups with a common saturation based on their ``sparsity''. We propose to qualitatively describe sparsity of a semigroup by considering which…

We prove a representation theorem for totally ordered idempotent monoids via a nested sum construction. Using this representation theorem we obtain a characterization of the subdirectly irreducible members of the variety of semilinear…

A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…

We prove that the free algebra functor associated to a symmetric, pseudo commutative 2-monad, from the underlying symmetric monoidal 2-category to the 2-category of algebras and pseudo maps over the 2-monad can be enhanced to a…

Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of…

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

A description of all subsemigroups of $M_2(\mathbb{C})$ which are given by a countable intersection of constructible sets is given. Furthermore, it is shown that they are intersections of constructible semigroups.

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

For a given inverse semigroup, one can associate an \'etale groupoid which is called the universal groupoid. Our motivation is studying the relation between inverse semigroups and associated \'etale groupoids. In this paper, we focus on…

We provide an abstract categorical framework that relates the Cuntz semigroups of the C$^*$-algebras $A$ and $A\otimes \mathcal{K}$. This is done through a certain completion of ordered monoids by adding suprema of countable ascending…

In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…

It is shown that the category of \emph{semi-biproducts} of monoids is equivalent to the category of \emph{pseudo-actions}. A semi-biproduct of monoids is a new notion, obtained through generalizing a biproduct of commutative monoids. By…

In this paper we provide an account of the Todd-Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd-Coxeter…

We previously showed that abstract Cuntz semigroups form a closed symmetric monoidal category. This automatically provides additional structure in the category, such as a composition and an external tensor product, for which we give…

A congruence $\varepsilon$ on a semigroup $S$ is perfect if for any congruence classes $x\varepsilon$ and $y\varepsilon$ their product as subsets of $S$ coincides (as a set) with the congruence class $(xy)\varepsilon$. Perfect congruences…