A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A derangement, that is, a permutation without fixed points, of a finite set is said to be an adjacent cycle when all its cycles are formed by a consecutive set of integers. In this paper we determine enumerative properties of these permutations using analytical and bijective proofs. Moreover a combinatorial interpretation in terms of linear species is provided. Finally we define and investigate the case of the adjacent cycle derangements of a multiset.doi:10.5402/2012/340357 fatcat:tuu5jumjx5a6bk2hw2yxbrdtmq