Hierarchy of efficient generators of the symmetric inverse monoid.
Higher order relations for a numerical semigroup
Homology of gaussian groups
We describe new combinatorial methods for constructing explicit free resolutions of by -modules when is a group of fractions of a monoid where enough lest common multiples exist (“locally Gaussian monoid”), and therefore, for computing the homology of . Our constructions apply in particular to all Artin-Tits groups of finite Coexter type. Technically, the proofs rely on the properties of least common multiples in a monoid.
Homomorphisms of free contents.
How much semigroup structure is needed to encode graphs ?
Hyperidentities and hypervarieties.
Hyperidentities of groups and semigroups.
Hyperidentities of groups and semigroups. (Short Communication).