Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Enumeration of derangements with descents in prescribed positions

Abstract : 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 $\lambda$-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 $\pi$ is chosen uniformly among all permutations on $n$ elements, the events that $\pi$ has descents in a set $S$ of positions, and that $\pi$ is a derangement, are positively correlated.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 11:09:24 AM
Last modification on : Thursday, June 18, 2020 - 10:18:03 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:50:34 AM


Publisher files allowed on an open archive




Niklas Eriksen, Ragnar Freij, Johan Wästlund. Enumeration of derangements with descents in prescribed positions. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.385-396, ⟨10.46298/dmtcs.2738⟩. ⟨hal-01185430⟩



Record views


Files downloads