Counting multiderangements by excedances.
Counting occurrences of 132 in an even permutation.
Counting ordered patterns in words generated by morphisms.
Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Counting rises, levels, and drops in compositions.
Counting segmented permutations using bicoloured Dyck paths.
Counting stabilized-interval-free permutations.
Counting subwords in a partition of a set.
Counting the number of unavoidable sets of a given size in a finite set of integers.
Counting words by number of occurrences of some patterns.
Covering Sets by Subsets.
Cycle lengths in a permutation are typically Poisson.
Cyclic derangements.
Dartboard arrangements.
Décompositions d'un intervalle réel et des ensembles de Cantor
Decreases and descents in words.
Dénombrements relatifs à une définition combinatoire de la continuité sur un graphe
Derangements and asymptotics of the Laplace transforms of large powers of a polynomial.
Des permutations
Descents of derangements and circular words. (Descentes des dérangements et mots circulaires.)