Counting King Permutations on the Cylinder

Eli Bagno, Estrella Eisenberg, Shulamit Reches +1

We call a permutation $\sigma =[{\sigma }_1,\dots ,{\sigma }_n]\in S_n$ a {\em cylindrical king permutation} if $|{\sigma }_i-{\sigma }_{i+1}|>1$ for each $1\le i\le n-1$ and $|{\sigma }_1-{\sigma }_n|>1$. We present some results…