Translations of distributive and modular ordered sets
In the first part of the paper we are concerned about finite sequences (over arbitrary symbols) for which . The function measures the maximum length of finite sequences over symbols which contain no subsequence of the type . It follows from the result of Hart and Sharir that the containment is a (minimal) obstacle to . We show by means of a construction due to Sharir and Wiernik that there is another obstacle to the linear growth. In the second part of the paper we investigate whether...
Cette étude s'inscrit dans un prolongement algorithmique d'un travail de Bruno Leclerc, publié dans cette revue, qui discute de la taille maximum d'une antichaîne dans un produit direct P d'ordres totaux. On y présente un algorithme de partitionnement de P en un nombre minimum de chaînes. Enfin, on décrit brièvement une application à l'extraction de connaissance.
We define new combinatorial objects, called shrubs, such that forests of rooted trees are shrubs. We then introduce a structure of operad on shrubs. We show that this operad is contained in the Zinbiel operad, by using the inclusion of Zinbiel in the operad of moulds. We also prove that this inclusion is compatible with the richer structure of anticyclic operad that exists on Zinbiel and on moulds.