100, rue des maths 38610 Gières / GPS : 45.193055, 5.772076 / Directeur : Louis Funar

Guillaume Gandolfi

The monoid embedding problem
Mercredi, 22 Janvier, 2020 - 17:00 à 18:00
Résumé : 

A monoid is defined in the same way as a group except one do not require the elements to be invertible. Because of this simple difference the class of monoids is more chaotic than the one of groups and therefore when studying a monoid, it can be useful to know whether this monoid can be embedded into a group because the monoid will then behave more nicely than average. This is the monoid embedding problem. In this talk after having described the basic notions linked to this problem, I will talk about some sufficient, necessary and both sufficient and necessary conditions for a monoid to be embeddable into a group before mentioning a different approach, namely the compatibility of embeddability with some algebraic constructions.

Institution de l'orateur : 
Université de Caen
Thème de recherche : 
Compréhensible
Salle : 
Salle 4
logo uga logo cnrs