Niklas Eriksen ; Ragnar Freij ; Johan Wästlund
-
Enumeration of derangements with descents in prescribed positions
dmtcs:2738 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2009,
DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
-
https://doi.org/10.46298/dmtcs.2738
Enumeration of derangements with descents in prescribed positionsArticle
Authors: Niklas Eriksen 1; Ragnar Freij 1; Johan Wästlund 2,1
NULL##NULL##NULL
Niklas Eriksen;Ragnar Freij;Johan Wästlund
1 Department of Mathematical Sciences
2 Department of Mathematics
We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we consider fixed point λ-coloured permutations, which are easily enumerated. Several formulae regarding these numbers are given, as well as a generalisation of Euler's difference tables. We also prove that except in a trivial special case, if a permutation π is chosen uniformly among all permutations on n elements, the events that π has descents in a set S of positions, and that π is a derangement, are positively correlated.
István Mező;José L. Ramírez, 2022, Set partitions and partitions without singleton blocks of type B, Periodica Mathematica Hungarica, 85, 2, pp. 246-263, 10.1007/s10998-021-00439-1.
Abdelkader Benyattou;Miloud Mihoubi, 2017, Curious congruences related to the Bell polynomials, Quaestiones Mathematicae, 41, 3, pp. 437-448, 10.2989/16073606.2017.1391349.
Jean-Luc Baril, 2012, Statistics-preserving bijections between classical and cyclic permutations, Information Processing Letters, 113, 1-2, pp. 17-22, 10.1016/j.ipl.2012.10.003.