We present an insertion algorithm of Robinson–Schensted type that applies to set-valued shifted Young tableaux. Our algorithm is a generalization of both set-valued non-shifted tableaux by Buch and non set-valued shifted tableaux by Worley and Sagan. As an application, we obtain a Pieri rule for a K-theoretic analogue of the Schur Q-functions. Résumé Nous présentons un algorithme d’insertion de...

In this paper, we present an algorithm to infer a fuzzy partition over a set of numerical values. This algorithm is based on the mathematical morphology and is expressed in the formal language theory. We use it during the construction of a fuzzy decision tree, in the case where no fuzzy partition is available for a numerical attribute. R esum e Dans ce rapport, nous pr esentons un algorithme po...