On the inner structure of a permutation: Bicolored Partitions and Eulerians, Trees and Primitives

Adrian Ocneanu

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of…