Related papers: The Todd-Coxeter Algorithm for Semigroups and Mono…
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
The aim of this paper is to investigate the homology groups of mathematical models of concurrency. We study the Baues-Wirsching homology groups of a small category associated with a partial monoid action on a set. We prove that these groups…
In this paper we characterize the monoid congruences of commutative semigroups by the help of the notion of the separator of subsets of semigroups. We show that every monoid congruence of a commutative semigroup S can be constructed by the…
We present an algorithmic approach to the conjugacy problems in monoids and semigroups, using rewriting systems. There is a class of monoids and semigroups that satisfy the condition that the transposi- tion problem and the left and right…
This survey describes the method of approximation of operator semigroups, based on the Chernoff theorem. We outline recent results in this domain as well as clarify relations between constructed approximations, stochastic processes,…
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…
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 present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
The construction of bases for quotients is an important problem. In this paper, applying the method of rewriting systems, we give a unified approach to construct sections---an alternative name for bases in semigroup theory---for quotients…
Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of applications. It is therefore interesting to investigate the…
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…
We study analogues of Kronecker coefficients for symmetric inverse semigroups, for dual symmetric inverse semigroups and for the inverse semigroups of bijections between subquotients of finite sets. In all cases we reduce the problem of…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…
The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…
A notion of {\em normal submonoid} of a monoid $M$ is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf{NorSub}(M)$ of normal submonoids of $M$ is a complete lattice. Joins are…