Related papers: The Todd-Coxeter Algorithm for Semigroups and Mono…
We systematically investigate, for a monoid $M$, how topos-theoretic properties of $\mathbf{PSh}(M)$, including the properties of being atomic, strongly compact, local, totally connected or cohesive, correspond to semigroup-theoretic…
We present a construction for the holomorph of an inverse semigroup, derived from the cartesian closed structure of the category of ordered groupoids. We compare the holomorph with the monoid of mappings that preserve the ternary heap…
We prove standard results of group cohomology -- namely, existence of a long exact sequence, classification of torsors via the first cohomology group, Shapiro's lemma, the Hochschild-Serre spectral sequence, a decomposition of the cochain…
Using the Baum-Connes conjecture with coefficients, we develop a K-theory formula for reduced C*-algebras of strongly $0$-$E$-unitary inverse semigroups, or equivalently, for certain reduced partial crossed products. In the case of…
Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…
In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing the structure of a finite semigroup from a generating set. As was the case with the original algorithm of Froidure and Pin, the algorithms presented…
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one…
Coclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a similar approach for finite nilpotent semigroups. This differs from the group theory setting in…
Relying on the notions of submodular function and partial metric, we introduce normed inverse semigroups as a generalization of normed groups and sup-semilattices equipped with an upper valuation. We define the property of skew-convexity…
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…
Computations in small Coxeter groups or dihedral groups suggest that the partition into Kazhdan-Lusztig cells with unequal parameters should obey to some semicontinuity phenomenon (as the parameters vary). The aim of this paper is to…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…
In this paper, a formula for the calculation of the number of right cosets contained in a double coset with respect to a unimodular group over a Dedekind domain is developed, and applications of this formula in the theory of congruence…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
In this paper we obtain some noncommutative multiplier theorems and maximal inequalities on semigroups. As applications, we obtain the corresponding individual ergodic theorems. Our main results extend some classical results of Stein and…
In this paper, we construct a new homology theory for semi-groups satisfying the self distributivity axiom or the idempotency axiom. Next, we consider the geometric realization corresponding to the homology theory. We continue with the…
In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent…
We describe algorithms for computing various functors for algebraic D-modules, i.e. systems of linear partial differential equations with polynomial coefficients. We will give algorithms for restriction, tensor product, localization, and…
We study the arithmetic of seminormal $v$-noetherian weakly Krull monoids with nontrivial conductor which have finite class group and prime divisors in all classes. These monoids include seminormal orders in holomorphy rings in global…