Counting King Permutations on the Cylinder
Eli Bagno, Estrella Eisenberg, Shulamit Reches, Moriah Sigron

TL;DR
This paper investigates the properties and distribution of cylindrical king permutations, a special class of permutations with specific adjacency constraints, including their asymptotic behavior and a new permutation parameter called cyclic bonds.
Contribution
It introduces the concept of cylindrical king permutations, derives recursions, and analyzes their asymptotic distribution and a new permutation parameter, cyclic bonds.
Findings
Derived recursions for cylindrical king permutations
Calculated their asymptotic proportion among king permutations
Analyzed the distribution of cyclic bonds in permutations
Abstract
We call a permutation a {\em cylindrical king permutation} if for each and . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Bayesian Methods and Mixture Models · Coding theory and cryptography
