Generating Functions for the Number of Permutations with Limited Displacement

Let $V(d,n)$ be the number of permutations $p$ of $\{1,2,\ldots ,n\}$ that satisfy $|p_i-i|\le d$ for all $i$. Generating functions for $V(d,n)$, for fixed $d$, are given.

[1]  Anxiao Jiang,et al.  Rank modulation for flash memories , 2008, 2008 IEEE International Symposium on Information Theory.

[2]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[3]  Anxiao Jiang,et al.  Error-correcting codes for rank modulation , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  Torleiv Kløve,et al.  Permutation Arrays Under the Chebyshev Distance , 2009, IEEE Transactions on Information Theory.