Counting fixed-point-free Cayley permutations

Abstract: Cayley permutations generalize permutations by allowing repeated values. We use two-sort species to derive differential equations that capture the recursive structure of their functional digraphs. These equations enable us to enumerate fixed-point-free Cayley permutations. Our approach also yields combinatorial identities and counting formulas for Cayley permutations whose functional digraphs have specific graph-theoretical properties, such as being a tree, being a forest, or being connected.