Concept

Monoïde des traces

Publications associées (7)

The algebra of Boolean matrices, correspondence functors, and simplicity

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...

2020

Laser-assisted morphing of complex three dimensional objects

Yves Bellouard, Jakub Drs

Morphing commonly refers to the smooth transition from a specific shape into another one, in which the initial and final shapes can be significantly different. In this study, we show that the concept of morphing applied to laser micro-manufacturing offers ...

Spie-Int Soc Optical Engineering2016

The algebra of essential relations on a finite set

Jacques Thévenaz, Serge Bouc

Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called inessential rel ...

Walter de Gruyter2016

The monoid algebra of all relations on a finite set

Jacques Thévenaz, Serge Bouc

We classify all the simple modules for the algebra of relations on a finite set, give their dimension, and find the dimension of the Jacobson radical of the algebra. ...

2015

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

Deciding Conditional Termination

We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exis ...

Tech Univ Braunschweig2014

Order-adjoint monads and injective objects

Gavin Jay Seal

Given a monad T on Set whose functor factors through the category of ordered sets with left adjoint maps, the category of Kleisli monoids is defined as the category of monoids in the hom-sets of the Kleisli category of T. The Eilenberg-Moore category of T ...

Elsevier2010