English

Counting King Permutations on the Cylinder

Combinatorics 2020-01-10 v1

Abstract

We call a permutation σ=[σ1,,σn]Sn\sigma=[\sigma_1,\dots,\sigma_n] \in S_n a {\em cylindrical king permutation} if σiσi+1>1 |\sigma_i-\sigma_{i+1}|>1 for each 1in11\leq i \leq n-1 and σ1σn>1|\sigma_1-\sigma_n|>1. We present some results regarding the distribution of the cylindrical king permutations, including some interesting recursions. We also calculate their asymptotic proportion in the set of the 'king permutations', i.e. the ones which satisfy only the first of the two conditions above. With this aim we define a new parameter on permutations, namely, the number of {\em cyclic bonds} which is a modification of the number of bonds. In addition, we present some results regarding the distribution of this parameter.

Keywords

Cite

@article{arxiv.2001.02948,
  title  = {Counting King Permutations on the Cylinder},
  author = {Eli Bagno and Estrella Eisenberg and Shulamit Reches and Moriah Sigron},
  journal= {arXiv preprint arXiv:2001.02948},
  year   = {2020}
}
R2 v1 2026-06-23T13:06:51.302Z